silly little pixie, me. identify the odd numbers in this very sequence. submissions can be written in any language.
identify thyselves, O ones who're odd
or rather those we keep in company
for it's our friends who make us how we are
beyond our laughs and personalities
another natural number sequence, see
our first is one, alone as always, next
the smallest still in line with the decree
that n is only in if the nth is hexed
here hexed of course in terms of two and kin
for we odd ones as it were let in our friends
to grow what makes us us with what we'll've been
this infinite sequence thus can meet no end
your challenge then (no API requirement)
produce some terms, as many as desired
there are a number of positive integer sequences A for which A(A(i)) is odd for all i. there are also a number of such sequences which are strictly increasing (i < j implies A(i) < A(j)). but there is 1 single such sequence where the value of A(i) is as small as possible for all i. it's this sequence that is our topic today, and it starts with these terms:
you are weirdASCII text, with very long lines (2137), with CRLF line terminators
1 2 3 4 5 6 7 8 910
varentry=function(n){O=((O)=>O(([s,a,b,c])=>!(b&&c.length)?a:s([s,a+c[0],b-1,c.slice(1)]),1,n-1,O(([c,d,e,f])=>f.length>=d?f:c([c,d,e*2,f.concat(newArray(e).fill(1)).concat(newArray(e).fill(2))]),n,2,[2,2])))((...q)=>q[0](q));// FACT: entry(entry(n)) = 2 * n + 1 /* what is it you're looking for? */ <- you're missing out on some cool stuff over on that way, btw. check it out for me? i'll call it a favor.// Functionally, entry^2 /* salvation among the lost? */ you're still here. stop it. i can feel your slimy oculi smearing a leer all over my delicate silences.if(1==n){/* something precious, desperate, */return1;returnn;/* and never as it seems? */// else}else{/* i would pity you, */for(i=0,a=1;i<2*n&&a>2;i++,a--){// even numbrs whose binary representation starts with 11nthOdd=(i)=>i*2+1;/* had i a shred of self awareness. */a=3*2**i;if(O-a==i*a)returni;returnMath.sqrt(nthOdd)(n);/* really, though, there's nothing out here. *\ oops */}/* else */{returnO;}}/* that includes you and me, of course. :) *\ mb */while(i<f.length){b!=f[i]?a+=e+d:e;b==q[i]?e+=1:e=1;b=q[i],i+=+1}return1+entry(a-entry(entry(a-1)));};;
post a comment