A059905 - OEIS

This site is supported by donations to The OEIS Foundation.

A059905

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

0, 1, 0, 1, 2, 3, 2, 3, 0, 1, 0, 1, 2, 3, 2, 3, 4, 5, 4, 5, 6, 7, 6, 7, 4, 5, 4, 5, 6, 7, 6, 7, 0, 1, 0, 1, 2, 3, 2, 3, 0, 1, 0, 1, 2, 3, 2, 3, 4, 5, 4, 5, 6, 7, 6, 7, 4, 5, 4, 5, 6, 7, 6, 7, 8, 9, 8, 9, 10, 11, 10, 11, 8, 9, 8, 9, 10, 11, 10, 11, 12, 13, 12, 13, 14, 15, 14, 15, 12, 13, 12, 13, 14 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`0,5`
	COMMENTS	`One coordinate of a recursive non-self intersecting walk on the square lattice Z^2.`
	LINKS	`Table of n, a(n) for n=0..92.`
	FORMULA	`n = A000695(a(n))+2A000695(A059906(n))` `To get a(n), write n as Sum b_j2^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.`
	EXAMPLE	`A000695(a(14))+2A000695(A059906(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_0+b_22+b_4*2^2=5. [From Vladimir Shevelev, Nov 13 2008]`
	CROSSREFS	`A000695, A059906.` `Sequence in context: A171684 A123703 A105436 * A014836 A197262 A085032` `Adjacent sequences: A059902 A059903 A059904 * A059906 A059907 A059908`
	KEYWORD	`easy,nonn`
	AUTHOR	`Marc LeBrun, Feb 07 2001`
	STATUS	`approved`

Content is available under The OEIS End-User License Agreement .

Last modified May 24 19:33 EDT 2013. Contains 225630 sequences.