id:A059905 - OEIS Search Results

Search: id:A059905

Displaying 1-1 of 1 results found.

page 1

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

+0
8

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; listen)

	OFFSET	`0,5`
	COMMENT	`One coordinate of a recursive non-self intersecting walk on the square lattice Z^2.`
	FORMULA	`n = A000695(a(n))+2*A000695(A059906(n))`
	EXAMPLE	`A000695(a(14))+2A000695(A059906(14)) = A000695(2)+2A000695(3) = 4+2*5 = 14.`
	CROSSREFS	`A000695, A059906.` `Sequence in context: A138680 A123703 A105436 this_sequence A014836 A085032 A004549` `Adjacent sequences: A059902 A059903 A059904 this_sequence A059906 A059907 A059908`
	KEYWORD	`easy,nonn`
	AUTHOR	`Marc LeBrun (mlb(AT)well.com), Feb 07 2001`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research