id:A056529 - OEIS Search Results

Search: id:A056529

Displaying 1-1 of 1 results found.

page 1

Number of iterations of sum of digits of square to reach 1, 9, 13 or 16.

+0
3

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

	OFFSET	`1,2`
	EXAMPLE	`a(2)=3 because successive iterations give 2 -> 4 -> 7 -> 13 -> 16 -> 13 etc.`
	CROSSREFS	`Cf. A004159 for sum of digits of square, A056528 for two iterations, A056020 where iteration settles to 1, A056020 where iteration settles to 9, A056527 where iteration settles to 13 and 16.` `Sequence in context: A016570 A070773 A046804 this_sequence A087282 A105973 A088429` `Adjacent sequences: A056526 A056527 A056528 this_sequence A056530 A056531 A056532`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Jun 19 2000`

page 1

Search completed in 0.002 seconds

Last modified November 24 14:25 EST 2009. Contains 167438 sequences.

AT&T Labs Research