Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A094450
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A094450 Number of iterations of the sum of digits of the divisors of 10^n needed to reach 15. +0
1
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; listen)
OFFSET

1,1

CROSSREFS

Cf. A034690, A086793.

Sequence in context: A040023 A109683 A140267 this_sequence A038336 A087868 A109065

Adjacent sequences: A094447 A094448 A094449 this_sequence A094451 A094452 A094453

KEYWORD

base,nonn

AUTHOR

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

page 1

Search completed in 0.003 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research