Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

2019.07 Math Sequences Squashathon #30

Closed
AlexDaniel opened this issue Jun 16, 2019 · 8 comments

Comments

Projects
None yet
4 participants
@AlexDaniel
Copy link
Collaborator

commented Jun 16, 2019

Hello! I saw your blog post and I think it's a great topic for the upcoming squashathon. Currently the topic for 2019.07 is set to something else, and we're discussing if it'd make sense to change it. Obviously to make it happen we'll need you to be on board, and I'll likely need admin privileges for this repo so that I can set and maintain the webhook for a bot (during the event).

Basically, the idea is to make a list of sequences that are not implemented yet, and distribute them across contributors. As usual, the most prominent contributor gets a plush camelia.

What do you think?

@ajs

This comment has been minimized.

Copy link
Owner

commented Jun 16, 2019

Sounds great! I'm completely on board. However, my work demands are high and I can never be sure when I'll have time to be involved. As long as you don't need me directly, that's fine. As for admin privs, I can certainly add you.

One issue: there are some sequences that are very hard (either in terms of implementation or computation or both). It's important to select carefully. The OEIS entries actually have keywords "hard" and "easy" for this purpose.

@taboege

This comment has been minimized.

Copy link
Contributor

commented Jun 16, 2019

Count me in if this is going to be the squashathon this month. It's not my area of expertise (at all!), but at least I hope to get some credit as a math PhD student with an impure, practical interest in integer sequences and the OEIS in particular. It might be appropriate to mention my OEIS module and that the "easy" and "hard" keywords are implemented there and smartmatch:

OEIS::lookup-all(1, 1, * + * ... *).grep(* !~~ OEIS::easy).head.say;
#= OEIS A290689 «Number of transitive rooted trees with n nodes.»

</plug>. Might be useful as a CLI tool during the squashathon?

@JJ

This comment has been minimized.

Copy link
Contributor

commented Jul 5, 2019

The squashathon just started!

@JJ

This comment has been minimized.

Copy link
Contributor

commented Jul 5, 2019

Has the hook been set already?

@AlexDaniel

This comment has been minimized.

Copy link
Collaborator Author

commented Jul 5, 2019

and I'll likely need admin privileges for this repo so that I can set and maintain the webhook for a bot (during the event).

I don't have that. Can't set up the hook right now. I think it has something to do with github limitation as to how it treats personal repos, or something like that. Anyway, to do it, an admin of this repo should:

@AlexDaniel

This comment has been minimized.

Copy link
Collaborator Author

commented Jul 5, 2019

Ping @ajs.

@AlexDaniel

This comment has been minimized.

Copy link
Collaborator Author

commented Jul 6, 2019

OK, I guess the webhook is not happening, but it's alright. I'll be merging a bunch of PRs so that it's easier to see which sequences are still not implemented. We'll review the results manually later!

@AlexDaniel AlexDaniel closed this Jul 6, 2019

@AlexDaniel

This comment has been minimized.

Copy link
Collaborator Author

commented Jul 7, 2019

This squashathon is over!

I did my best to compile a list of contributions. In total there were 60 sequences (plus some hardcoded ones) that were implemented during this squashathon!

Here is the list:

  • @tbrowder
    • ASCII equivalents for integer sequences


  • @MasterDuke17 (MasterDuke)
    • A000111
    • A000364
    • A001003
    • A001519
    • A004011
    • A006894

  • @taboege (tobs)
    • A000029
    • A000031
    • A000048
    • A001037
    • A001481
    • A008683
    • A025487
    • A lot of useful subroutines

  • @AlexDaniel
    • A000594
    • A000793
    • A000959 (but broken)
    • A001190
    • A002083
    • A002654
    • A005230
    • A074206
    • hardcoded versions of more sequences (A000109, A000112, A000609, A002106, A003094, A005470, A006966)
    • whitespace and .pm6/.t6 changes
    • a script to populate the issue tracker

  • @thundergnat
    • A000010
    • A000110
    • A000161
    • A000166
    • A000169
    • A000182
    • A000262
    • A000311
    • A000312
    • A000326
    • A000330
    • A000396
    • A000593
    • A000688
    • A000961
    • A001045
    • A001113
    • A001285
    • A001333
    • A001699
    • A001906
    • A002110
    • A002113
    • A002572
    • A002658
    • A003136
    • A005117
    • A005130
    • A005811
    • A006318
    • A008277
    • A010060
    • A027641
    • A027642
    • A038566
    • A038567
    • A038568
    • A038569
    • A fix to disambiguify A002572 and A005588
    • A lot of useful subroutines

🎉🎉 And the winner is @thundergnat! 🎉🎉 (Please contact @lizmat to get your plush camelia!)

See you all next month in another repository :)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
You can’t perform that action at this time.