login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A176762 Smallest number that takes n steps to reach a cycle under iteration of sum-of-squares-of-digits map. 1
1, 10, 13, 23, 19, 7, 356, 4, 2, 11, 15, 5, 3, 14, 45, 36, 6, 112, 269, 15999 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..19.

FORMULA

a(n) = minimum of either A001273(n) or A094406(n+3).

MATHEMATICA

f[n_] := Plus @@ (IntegerDigits[n]^2); t = Table[0, {25}]; k = 1; While[k < 150000001, a = Length@ NestWhileList[f, k, UnsameQ@## &, All] - 1; If[a < 25 && t[[a]] == 0, t[[a]] = k; Print[{a, k}]]; k++ ]

CROSSREFS

Cf. A001273, A094406, A045646, A003001.

Sequence in context: A095918 A191969 A018785 * A001273 A111524 A074346

Adjacent sequences:  A176759 A176760 A176761 * A176763 A176764 A176765

KEYWORD

nonn,base

AUTHOR

Robert G. Wilson v, Apr 25 2010

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 23 20:23 EST 2017. Contains 295141 sequences.