id:A033909 - OEIS Search Results

Search: id:A033909

Displaying 1-1 of 1 results found.

page 1

Number of Sort then Add steps needed to reach a sorted number, or -1 if never reach sorted number.

+0
3

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 3, 2, 0, 0, 0, 0, 1, 1, 1, 3, 2, 2, 2, 0, 0, 0 (list; graph; listen)

	OFFSET	`0,65`
	EXAMPLE	`64 -> 64+46=110 -> 110+11=121 -> 121+112 = 233, taking 3 steps to reach a sorted number, so a(64)=3.`
	CROSSREFS	`Cf. A033863, A033908.` `Sequence in context: A068542 A036112 A134884 this_sequence A133949 A139808 A055654` `Adjacent sequences: A033906 A033907 A033908 this_sequence A033910 A033911 A033912`
	KEYWORD	`nonn,base`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

page 1

Search completed in 0.002 seconds

Last modified December 5 17:24 EST 2009. Contains 170342 sequences.

AT&T Labs Research