login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A056529 Number of iterations of sum of digits of square to reach 1, 9, 13 or 16. 2
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; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..105.

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: A287571 A214316 A236452 * A087282 A105973 A088429

Adjacent sequences:  A056526 A056527 A056528 * A056530 A056531 A056532

KEYWORD

base,easy,nonn

AUTHOR

Henry Bottomley, Jun 19 2000

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 25 03:49 EST 2020. Contains 331241 sequences. (Running on oeis4.)