« first day (25 days earlier)      last day (89 days later) » 

NieDzejkob
NieDzejkob
09:43
uh, so I just noticed Forth has been used thrice... and the third time was by me...
Mr. Xcoder
Mr. Xcoder
I solved the next sequence. Try it online! (I'll try to port it to another language)
Warning: Very inefficient
NieDzejkob
NieDzejkob
I did it also: Try it online!
Mr. Xcoder
Mr. Xcoder
@NieDzejkob Can't you just switch the version?
NieDzejkob
NieDzejkob
(in Python)
Mr. Xcoder
Mr. Xcoder
I'll try another more efficient approach in Pyth too
And then port
Got a much shorter and much more efficient one now: Try it online!
Let's see... Looking for a golfing language that hasn't been used yet (Except for Brachylog) Perfect... Gaia!
@NieDzejkob Posted (I thought I'd let you know just in case you were porting it too).
Mr. Xcoder
Mr. Xcoder
10:16
CMP: How much rep did you earn thanks to "One OEIS after another"
@Mr.Xcoder 380.
Caird should have gotten exactly double according to my calculations, 760
 
2 hours later…
NieDzejkob
NieDzejkob
12:22
@Mr.Xcoder Forth compatibility is, to put it mildly, terrible
Mr. Xcoder
Mr. Xcoder
Ah ok.
NieDzejkob
NieDzejkob
It would be best to find a Forth with arbitrary arithmetic, because if I'm specifying the interpreter, it better compute the sequence up to a 1000
Mr. Xcoder
Mr. Xcoder
@NieDzejkob You'll change the language without affecting the byte count or something?
Or you can just let it be this way, as long as you don't use Forth in the next 150 languages (a new series is coming soon) ?
NieDzejkob
NieDzejkob
but it still might be a problem since answer #256 needs more than 64 bits of integer precision to compute indexes above 17
Mr. Xcoder
Mr. Xcoder
IDK I have 0 experience with forth...
NieDzejkob
NieDzejkob
12:42
I have an idea
Mr. Xcoder
Mr. Xcoder
I'm all ears
NieDzejkob
NieDzejkob
13:27
@Mr.Xcoder edited
Mr. Xcoder
Mr. Xcoder
Thanks god you fixed that
user202729
user202729
Actually most Java solution overflow 32 bit int...
Mr. Xcoder
Mr. Xcoder
Shhh :P
NieDzejkob
NieDzejkob
it doesn't matter if the result doesn't fit in 32 bit, but this divided a big number by another big number at the very end, which makes the result fit, but not the intermediate steps
user202729
user202729
13:50
@Mr.Xcoder Any way to calculate it efficiently? ...
Mr. Xcoder
Mr. Xcoder
@user202729 Yeah. Type user:me One OEIS after another in PPCG's search bar, add the votes on each and multiply by 10 (unless you are caird)
user202729
user202729
In that case, add 83 * 5 - 3 * 2.
var a=$('.vote-count-post strong'),s=0;for(var x=0x<a.length;++x)s+=+a[x].innerHTML;s*10
> 500
(assuming they fit on one page)
 
4 hours later…
NieDzejkob
NieDzejkob
17:49
Am I right that the g.f. for the next sequence is [1 + 2(x + x^2 + x^3 + x^4 + x^5 + x^6 + ...)]^5?
 
1 hour later…
NieDzejkob
NieDzejkob
19:08
new sequence
(and the feed still doesn't work)
Mr. Xcoder
Mr. Xcoder
19:26
New sequence
The next one is really nice.
 
3 hours later…
NieDzejkob
NieDzejkob
22:47
Solved it in Unefunge, with an easter egg as padding :P

« first day (25 days earlier)      last day (89 days later) »