« first day (2366 days earlier)      last day (2770 days later) » 

00:00
(it is pretty easy to find near-impossible-to-code OEIS sequences if you know where to look)
the alternative is setting the next person up with whatever sequence, letting the chain go on. this doesn't affect your own chances of winning in any meaningful way either
@Lynn Hold on, so is this why you can't answer twice in a row? (Otherwise you could answer and then break the chain and win)
I guess that's part of it, but also that is a pretty general answer-chaining rule
that's a pretty standard winning criterion, no?
ninja'd
@cairdcoinheringaahing @BlackCap: Dispute over this answer: It was posted about 21 minutes after BlackCap's other answer, which, according to specs is invalid. Judgement?
Ah okay. Makes sense.
the usual winning criterion is the last answer wins. not the penultimate one
and then there is a strategy: make it hard for the next person
00:11
rip I have to look up the definition "penultimate"
second-to-last
oh ok 2nd-to-last
ninja'd
well rip I've lost 260 rep to the cap today
*259 because SE can't do math
how do you find that out?
own profile > activity > reputation > look at your upvotes and do math :P
00:15
nvm ignore me about the answer invalidation; I lied
searching for random sequences on oeis: oeis.org/A093140
do they just run out of ideas
@totallyhuman I think you have to send them legal identification and proof that you are a mathematician in order to post these too
wtf
is that just lambda n:(n and '4'*n+'5')or 1
whyyyyy
hey anybody know if there is a programatically good way to get the current number of oeis sequences?
00:28
what the heck
@orlp er wtf
that's extremely scary
wtf Python 1 didn't have list comps :(
replace it with a human and bingo you have your next horror movie antagonist
neither did they have +=
00:31
oeis.org/A290147 seems most recent
made today lol
so i just found out that b files can sometimes have comments
and it's another expansion ._.
> Contains 289648 sequences.
there are gaps?
come on
Someone should make a sequence of oeis gaps
i was gonna make a random sequence function but nvm :c
in the mean time print(oeis.Sequence(random.randint(1, 289648))) has worked so far so...
OEIS challenge continues :)
00:38
Is Mendeleev banned from all rooms or just this one?
Unfortunately, Python is now fully taken :(
@Downgoat full chatban
@Downgoat all
ouch
except I was ninja'd ;_;
again?
00:40
yes :P
You need to get a new keyboard, this is like the 4th time today
neutrino's code is very ungolfed :P
lol
no I'm just slow
I got distracted by the brief site outage
return c

def v(a,b):
newlines?
reeeeeeeeeeeeeee
lel
this isn't code-golf :P
I was looking for a nice next sequence lol
00:44
what's a356?
<Sequence [A000356: Number of rooted cubic maps with 2n nodes and a distinguished Hamilton cycle: (2n)!(2n+1)! / (n!^2*(n+1)!(n+2)!).]>
not a nice sequence
for whatever reason Positron is somehow converting the * symbol into an identifier
BORK ALERT 🚨 BORK ALERT 🚨 BORK ALERT I done goof
ANDDDDDD another answer was posted
wow that was quick
o shit
aw got ninja'd
@totallyhuman ninja'd by 5 seconds :)
also my code was wrong
lol you delete-ninja'd my ninja comment about you getting ninja'd
00:50
so whatever :
@totallyhuman ffs ;_; lol
5 *
not 5 ^
my brain is BORK ALERT 🚨 BORK ALERT 🚨 BORK ALERT
@totallyhuman at least you have a brain
well I'm out of actual working languages I know
there's anyfix, PostL, etc.
but those are trash
Oh wait, I have Paintbrush (though that can't do anything lol)
00:51
next sequence is hard
I also have Java 2, 3, 4, 5, 6, 7, 8, and 9 :)))
> Expansion of Product_{m >= 1} (1 + x^m); number of partitions of n into distinct parts; number of partitions of n into odd parts (if n > 0).
yeah lol this one's hard
G.f.: x*(1+26*x+66*x^2+26*x^3+x^4) / (x-1)^6.
oh shiz maybe i can do that in python 1
oh that's easy
number of partitions into odd parts
o shit
with so many ninja's and self-deletions, this question is going to get autoprotected so hard
I mean of 38 answers, 10 are deleted lol
00:53
wait it leads to modulo by 0 on 1
tf
wat
there's no modulo...
division whoops
another one doesn't have a recursion stopper
> a(n) = 5*a(n-1) - 10* a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5) + 120. - Ant King, Sep 23 2013
ant king what did you mean
wait what
i was looking at the wrong sequence ><
hehe
love how your "filler text to ninja" still got you ninja'd
><
> a(n)=A026837(n)+A026838(n)=A118301(n)+A118302(n); a(A001318(n))=A051044(n); a(A090864(n))=A118303(n). - Reinhard Zumkeller, Apr 22 2006
Well thanks Reinhard >.>
wtf
wtf the partitions of a number are the way to sum to it, not to partition a list of size n????????????
01:02
Oh hey next ones Fibonacci
Lemme see if my nice little Fibonacci thing works on Python 1
Hey, I earned moderation tools
I can see deleted answers now
use them wisely :)
@BlackCap suddenly the number of answers in OEIS challenge increased by 10 lol
I have no idea how that happend
01:04
a bunch of deleted answers lol
@totallyhuman f=lambda n:(n>1and f(n-1)+f(n-2))or 1
f=lambda n:n*(n<3)or f(n-2)+f(n-1)
But it's 1-indexed
I don't like that rule
wut
ok i'm getting super confused
i'm not gonna try to answer this anymore tonight o0
oh eth changed it ;-;
01:18
lol
oh, A45 has already been used :/
it's kinda hard to keep track of that
6
Q: Reduce Code Length

Bill W.I have the following that works good, and computes in one shot,but the code is so long. Can someone please help me to reduce the size of this? n01=Flatten[{{{5,0,0},{6,0,0},{6,0,1},{6,0,2},{5,0,2},{4,0,2},{4,0,1},{4,0,0},{5,0,0}}},1]; n02={0,0,0.5}+RotationMatrix[45Degree,{0,0,1}].Transpose[%]//...

Hey looks its a but not on PPCG!
01:28
but- but it's tagged
A CG on CR on MthmSE
o0
hey can anybody write an answer checker?
in a snippet?
idk js enough
I think that that is equivalent to the halting problem :p
Can someone who knows math explain this?
@HyperNeutrino Read the wikipedia page on the neclace problem
01:32
thanks
I have a video too but I have to find it
that's a short wiki :P
The video will be more helpful when I find it
This video might be helpful
Its the one I was thinking of, but its less on topic than I thought
great video anyway
01:35
ah ok, if it's not about A000046 I'll look at it later
CMC: given positive integers a, b, c, return an array of b integers such that the first is a and the rest are c greater than the previous integer.
so an arithmetic sequence constructor
so a := 1 b := 10 c := 2 -> [1, 3, 5, 7, 9, 11, 13, 15, 17, 19]
a=>b=>c=>{int n=0;return Enumerable.Range(a,b).Select(i=>i+c*n++);}
interesting
I feel like the boring solution may be shorter.
Without LINQ magic
hey so there aren't any tryads in jelly
but maybe not since the longest part is still the Enumerable.Range(a,b) blob
01:43
so it's kinda restrictive
right?
shouldn't it be?
a=>b=>c=>{for(int i=0;i<a+b*c;i+=c)Console.WriteLine(i);}
It is shorter if you cut Enumerable.Range entirely.
I like LINQ tho it's fun ;-;
what is linq?
C#'s system for functional programming.
It's not exactly that but that's the easiest way to explain it.
It's also SQL operations. An example from the docs:
var queryLondonCustomers3 =
    from cust in customers
    where cust.City == "London"
    orderby cust.Name ascending
    select cust;
"Language Integrated Query"
@HyperNeutrino A necklace is a circle of two colored beads
two necklaces are equivalent if:
You can rotate one to make the other,
You can flip all the colors on one to make another
01:55
oh
You can turn the necklace over to make another
then why is A000046(2) not 2? You have [0, 0] and [0, 1].
is that what primitive means?
not all equal?
or any combination of those can make another
like any combination of the operations (rotate, reflect, complement)
I'm not sure why a(2) is not 2
01:57
I think primitive means that it's not single-colored?
Let me make a test implementation and see if that's right.
That may be the case
that fits for the first 3 examples
so first, all necklaces can be generated using binary numbers
not another do x without y >.>
but be careful you need to pad them
01:59
yeah, thanks for the warning
I could use a next function
@HyperNeutrino I don't think your defintion of primitive is correct
I'm getting 3 cases for 4 not 2
['0001', '0011', '0101']
Anyway it would just be a constant offset from the non-primitive case which would probably be noted on the OEIS page
Your best off dissecting the given code.
Hopefully you know Maple or Mathematica
Anyone want to play Contact?

 Contact

For playing the game Contact, where one person tries to "defend"...
YES
@HyperNeutrino If you figure it out tell me, I'd like to add a implementation in a free language to OEIS so that other people don't have to struggle.
@WheatWizard I know Mathematica, could I help?
(No idea what you guys are talking about)
We are trying to figure out this
There is Mathematica towards the bottom
But its mostly builtins
02:12
Can't tell if a11 or all
I think a11
Probably all
@WheatWizard alright, I will :)
No, I copy pasted into a different field
It's a11
actually its probably a11
NEVERMIND this mathematica is 2 complicated 4 me
I sorta understand what it's doing but no clue how to directly translate it to Ruby
02:21
(ノ°Д°)ノ︵ ┻━┻ too complicated for me
also my definition of primitive is definitely wrong
otherwise 1 -> 0
lol I give up
0
Q: Explanation of OEIS:A000046

HyperNeutrinoI'm looking at OEIS:A000046, whose definition states: Number of primitive n-bead necklaces (turning over is allowed) where complements are equivalent. I can't quite understand this. This is what I have so far: The necklace should have 2 types of beads (i.e. it is binary (?)) The necklace ...

(cc @WheatWizard)
;_; I wanted an answer more quickly
but lol I can't be too picky :P
OMG wtf I forgot a return statement in my code
(cc @WheatWizard) hey I solved A11, which brings me closer to a solution :)))
https://tio.run/##jVLLasMwEDzHX7FHK49i92jolwQTVGvTiiSSkJWQ5Odd62kZUxKDQezO7IxGqx7mV4p6GBgeQUtDDZeiL6nW9EGaYpVK8AX7tlgdpQbGb5yhPnDB8A5cgKbiB8szisCzxIn5QZVCwXxvPyM3LWzA15tZoyWjNJqrFpOporAeBd7NZM/a@dcG7KDews79zpJX8gLjfeoRkJdGBD/OKg18a6Sn5MX1vA@NN9Q9Zkn5AsuCet9ZJM@zWkQRUDGJ7nSmHfZlz59ox6gRwOW1P6RWMOPG2XPVwhosvFjlmCr4Nahd1pPnT1h7grMZ4wEhjcUsBS1qNno6b6C2TSsU39TpLJdu/Dp5UWe8oDDhCoGJoZgRPSFjxBDt@wY8cZil3QiNs17hJpGXE8N@pMnvEjIJEnfW5Zj2Pu1DmjEozYUpL1SVqbYNL1hXhJDhDw
02:42
I believe that url shorteners are not permitted in chat btw.
sorry.
there we go, multiline hack :P
so now I just need to know what primitive means ;_;
> Python 1
Oh no
ohlol
it's because that way I don't have to rewrite my solution before posting to OEIS challenge
so what does primitive mean (ノ°Д°)ノ︵ ┻━┻
hello
do you know what a primitive necklace is
02:47
@HyperNeutrino (ノ°Д°)ノ ︵ (ノ.º.)ノ
ok anyway, I'm still trying to get ideas for a koth
WHY WOULD OEIS USE A DEFINITION THAT'S NOT ANYWHERE ON THE INTERNET
what if... a team based koth, where each player selects one ability, and each ability is only available once?
Guys, can anyone tell if this xyz123 guy is serious? I really can't tell :S
02:55
FINALLY got it!
> 1112 bytes
;_;
(cc @WheatWizard) I got a Python method for A000046 (codegolf.stackexchange.com/a/134968/68942). I'll make this less expanded tomorrow, but here you go for now :)
ok sorry but the next sequence makes no sense lol
anyway I'm going to go to sleep now lol o/
Its just a continues fraction
oh
well then nvm
anyway o/
Anonymous
3 messages moved to Trash
03:57
Oh hey I can VTC on StackOverflow, just noticed
Immediately VTC's everything on the page
04:15
guess how long we can chain our answers :D
04:30
;_; python 1 doesn't have sets
@LeakyNun The question is, why Python 1 is being utilized.
@Phoenix I was just messing with HyperNeutrino's Python 1 code for the answer chaining
Ah, so the question should be directed at @HyperNeutrino?
maybe
 
1 hour later…
05:58
anyone here have mac?
@Downgoat I do
So do I. I also have cheese.
06:19
@Downgoat I do, too
Has Pari/GP been used?
Dang, it has!
@Mr.Xcoder can you install https://staging.vihan.org/VSL/macos/vsl chmod +x it, run it with -dast flag and tell me if it works?
@Downgoat No Windows build, I see?
I did install it now, what's that?
@Downgoat What do you mean by chmod +x it?
@Mr.Xcoder chmod +x <filepath>
it's the binary for VSL (a language I made)
@Phoenix there is at: https://staging.vihan.org/VSL/vsl.exe
if you could test that that would also be great :3
Ah, I went to staging.vihan.org/VSL and saw Linux and Mac directories
But not a windows directory
Sure, will test when downloads.
Also with -dast?
06:35
@Downgoat I chmod'd it. Now how should I run it with the dast flag? run vsl --dast? I know very little bash
What does -dast do, btw?
@Mr.Xcoder Goat said -dast, so presumably only one hyphen, but yes.
I really hope that means d, a, s, t are all seperate flags, if there's only one hyphen.
@Mr.Xcoder with one dash
Done. What now?
what was output?
@Phoenix it's short for --debug-ast
@Downgoat I am pasting the output now
06:37
Should still have two dashes ಠ_ಠ
Pavel@DESKTOP-F7NI02J MINGW32 ~/desktop
$ ./vsl -dast
pkg/prelude/bootstrap.js:1080
      throw error;
      ^

ReferenceError: os is not defined
    at getSupport (C:\snapshot\VSL\lib\cli\colorSupport.js:18:25)
    at Object.<anonymous> (C:\snapshot\VSL\lib\cli\colorSupport.js:72:13)
    at Module._compile (pkg/prelude/bootstrap.js:1151:22)
    at Object.Module._extensions..js (module.js:580:10)
    at Module.load (module.js:488:32)
    at tryModuleLoad (module.js:447:12)
    at Function.Module._load (module.js:439:3)
Mendeleev
wtf windows
Do I need to have node?
    ModuleError {
      message: '/XXX/XXX is not a VSL module, could not locate a `module.yml`',
      type: 1,
      data:
       { error:
          { Error: ENOENT: no such file or directory, open '/XXX/XXX/module.yml'
            errno: -2,
            code: 'ENOENT',
            syscall: 'open',
            path: 'XXX.yml' } } }
logout
Saving session...
...copying shared history...
...saving history...truncating history files...
...completed.
Deleting expired sessions...300 completed.

[Process completed]
I don't have node.js
@Downgoat ^^
06:38
@Phoenix you shouldn't need it. That's a really weird bug which is only cause if you have no OS
Ah. Is node.js bundeled?
@Mr.Xcoder are you sure you ran with -dast exactly? you shouldn't get that if you used the flag
OH FFS
Look, you can make the next sequence in 6 bytes using 05AB1E
@Phoenix a little bit
06:39
> Windows SmartScreen blocked vsl.exe
@Downgoat I ran it with dust, I can assure you. I'll try once more.
Clicking allow did not fix the error however.
Hmm
@Phoenix @Mr.Xcoder @Downgoat
why can you not?
@Downgoat I ran it once more, the same thing
06:41
@Downgoat I've just answered
@LeakyNun I will
@Mr.Xcoder thanks
then the next person (which hopefully is also me) will suffer
@Mr.Xcoder can you paste output + line w/ vsl command?
@Downgoat Wait a bit,
Actually A6 isn't that hard
@Downgoat maybe you can use Cheddar to solve A6 afterwards
06:43
@Downgoat I noticed that the error is referenceing files, but also that there were no files created in the directory I put VSL into?
@LeakyNun Done, check it out
@Downgoat your turn! :D
@Phoenix \snapshot is a simulated directory (since those JS files are compressed + bundled into the executable)
Ah
@Downgoat do you have instructions for building from source?
@LeakyNun You should have added one unnecessary character to have A000007 next :)
06:45
@Mr.Xcoder a challenge for you: do the actual thing in 3 bytes using 05AB1E
instead of 6 bytes
@LeakyNun I don't know 05AB1E, but I'll try
@Mr.Xcoder it's easy
I'll try that
after you build from source do npm i -g . to install globally
gtg to sleep tho g'night
06:47
who can chain the next answer then...
@Downgoat in your instructions you should add cd VSL after git clone ...
maybe one can use Jellyfish
but I seem to be the only one here who knows Jellyfish
but I gtg now
@LeakyNun I have 4: >*2÷>
@Mr.Xcoder 4?
5 sorry
06:50
> added 1394 packages in 91.43s
node.js is insane
that's tiny compared to other projects
Maybe use just js
and not thousands of libraries

« first day (2366 days earlier)      last day (2770 days later) »