A056529 - OEIS

This site is supported by donations to The OEIS Foundation.

A056529

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

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; refs; listen; history; internal format)

	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 * A087282 A105973 A088429` `Adjacent sequences: A056526 A056527 A056528 * A056530 A056531 A056532`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Jun 19 2000`

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

Last modified February 15 11:03 EST 2012. Contains 205763 sequences.