A193585 Number of cycles under iteration of sum of squares of digits in base b.

0, 1, 0, 1, 1, 2, 3, 2, 1, 2, 4, 3, 2, 7, 1, 2, 1, 3, 1, 6, 2, 8, 4, 6, 1, 5, 4, 6, 2, 8, 6, 5, 3, 5, 4, 5, 3, 6, 1, 7, 6, 6, 2, 5, 4, 11, 4, 4, 4, 6, 3, 11, 4, 9, 4, 8, 4, 6, 6, 5, 4, 9, 6, 5, 2, 6, 3, 7, 7, 8, 5, 14, 5, 8, 3, 6, 3, 4, 5, 10, 5, 10, 6, 8, 5

Offset: 2

Author

Martin Renner, Jul 31 2011

Keywords

• nonn
• base

Comments

If b>=2 and a>=b^2 then S(a,2,b)

Examples

			In the decimal system all integers go to (1) or (4, 16, 37, 58, 89, 145, 42, 20) under the iteration of sum of squares of digits, hence there is one fixed point and one cycle. Therefore a(10) = 1.
		

Links

• Martin Renner, Table of n, a(n) for n = 2..300
• H. G. Grundman, E. A. Teeple, Generalized Happy Numbers, Fibonacci Quarterly 39 (2001), nr. 5, p. 462-466.

Crossrefs

Cf. A193583, A193586.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

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