id:A061903 - OEIS Search Results

Search: id:A061903

Displaying 1-1 of 1 results found.

page 1

A061903

Number of distinct elements of the iterative cycle: n -> sum of digits of n^2.

+0
7

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

	OFFSET	`0,3`
	COMMENT	`It seems that any such iterative cycle can contain at most 4 distinct elements.`
	EXAMPLE	`a(2) = 4 since 2 -> 4 -> 1+6 = 7 -> 4+9 = 13 -> 1+6+9 = 16 -> 2+5+6 = 13, thus {4,7,13,16} are the distinct elements of the iterative cycle of 2. a(6) = 1 since 6 -> 3+6 = 9 -> 8+1 = 9 thus 9 is the only element in the iterative cycle of 3.`
	CROSSREFS	`Cf. A007953, A004159, A061904 - A061910.` `Adjacent sequences: A061900 A061901 A061902 this_sequence A061904 A061905 A061906` `Sequence in context: A021246 A019633 A067277 this_sequence A084118 A046071 A078147`
	KEYWORD	`nonn,base`
	AUTHOR	`Asher Auel (asher.auel(AT)reed.edu), May 17 2001`

page 1

Search completed in 0.002 seconds

Last modified November 8 20:39 EST 2009. Contains 166234 sequences.

AT&T Labs Research