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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094450 Number of iterations of the sum of digits of the divisors of 10^n needed to reach 15. 0
12, 10, 16, 15, 3, 11, 4, 13, 6, 6, 5, 19, 16, 3, 11, 13, 19, 7, 5, 9, 6, 16, 16, 19, 5, 3, 12, 3, 18, 16, 4, 10, 6, 16, 18, 12, 4, 16, 12, 13, 12, 5, 12, 5, 20, 15, 16, 12, 4, 16, 4, 20, 5, 19, 4, 6, 21, 5, 6, 5, 21, 12, 5, 16, 13, 17, 6, 5, 7, 21, 20, 18, 12, 10, 6, 18, 13, 13, 6, 13, 15 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

CROSSREFS

Cf. A034690, A086793.

Sequence in context: A040023 A109683 A140267 * A038336 A087868 A175042

Adjacent sequences:  A094447 A094448 A094449 * A094451 A094452 A094453

KEYWORD

base,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Jun 04 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 14 17:55 EST 2012. Contains 205653 sequences.