Many excellent designs for a new banner were submitted. We will use the best of them in rotation.
0,5
One coordinate of a recursive non-self intersecting walk on the square lattice Z^2.
Table of n, a(n) for n=0..92.
n = A000695(a(n))+2*A000695(A059906(n))
To get a(n), write n as Sum b_j*2^j, then a(n)=Sum b_(2j)*2^j. [From Vladimir Shevelev, Nov 13 2008]
a(n)=Sum_k>=0 {A030308(n,k)*A077957(k)}. - From Philippe Deléham, Oct 18 2011.
A000695(a(14))+2*A000695(A059906(14)) = A000695(2)+2*A000695(3) = 4+2*5 = 14.
If n=27, then b_0=1, b_1=1, b_2=0, b_3=1, b_4=1. Therefore a(n)=b_0+b_2*2+b_4*2^2=5. [From Vladimir Shevelev, Nov 13 2008]
A000695, A059906.
Sequence in context: A171684 A123703 A105436 * A014836 A197262 A085032
Adjacent sequences: A059902 A059903 A059904 * A059906 A059907 A059908
easy,nonn
Marc LeBrun, Feb 07 2001
approved
