id:A059906 - OEIS Search Results

Search: id:A059906

Displaying 1-1 of 1 results found.

page 1

Index of second half of decomposition of integers into pairs based on A000695.

+0
16

0, 0, 1, 1, 0, 0, 1, 1, 2, 2, 3, 3, 2, 2, 3, 3, 0, 0, 1, 1, 0, 0, 1, 1, 2, 2, 3, 3, 2, 2, 3, 3, 4, 4, 5, 5, 4, 4, 5, 5, 6, 6, 7, 7, 6, 6, 7, 7, 4, 4, 5, 5, 4, 4, 5, 5, 6, 6, 7, 7, 6, 6, 7, 7, 0, 0, 1, 1, 0, 0, 1, 1, 2, 2, 3, 3, 2, 2, 3, 3, 0, 0, 1, 1, 0, 0, 1, 1, 2, 2, 3, 3, 2, 2, 3, 3, 4, 4, 5, 5, 4, 4, 5, 5, 6 (list; graph; listen)

	OFFSET	`0,9`
	COMMENT	`One coordinate of a recursive non-self intersecting walk on the square lattice Z^2.`
	FORMULA	`n = A000695(A059905(n))+2A000695(a(n))` `To get a(n), write n as Sum b_j2^j, then a(n)=Sum b_(2j+1)*2^j. [From Vladimir Shevelev (shevelev(AT)bgu.ac.il), Nov 13 2008]`
	EXAMPLE	`A000695(A059905(14))+2A000695(a(14)) = A000695(2)+2A000695(3) = 4+25 = 14.` `If n=27, then b_0=1, b_1=1, b_2=0, b_3=1, b_4=1. Therefore a(n)=b_1+b_32=3. [From Vladimir Shevelev (shevelev(AT)bgu.ac.il), Nov 13 2008]`
	CROSSREFS	`A000695, A059905.` `Sequence in context: A071820 A055092 A130326 this_sequence A112046 A076902 A049113` `Adjacent sequences: A059903 A059904 A059905 this_sequence A059907 A059908 A059909`
	KEYWORD	`easy,nonn`
	AUTHOR	`Marc LeBrun (mlb(AT)well.com), Feb 07 2001`

page 1

Search completed in 0.002 seconds

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.

AT&T Labs Research