Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A046437
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A046437 7 steps needed to reach a prime under 'Sum of digits raised to its digits powers' procedure. +0
1
29, 92, 156, 165, 234, 243, 268, 286, 288, 324, 342, 423, 432, 506, 516, 560, 561, 605, 615, 628, 650, 651, 682, 688, 826, 828, 862, 868, 882, 886, 1035, 1049, 1053, 1094, 1135, 1149, 1153, 1194, 1256, 1265, 1305, 1315, 1350, 1351, 1409, 1419, 1447, 1455 (list; graph; listen)
OFFSET

0,1

CROSSREFS

Cf. A046431.

Sequence in context: A039416 A043239 A044019 this_sequence A044216 A044597 A138625

Adjacent sequences: A046434 A046435 A046436 this_sequence A046438 A046439 A046440

KEYWORD

nonn

AUTHOR

Patrick De Geest (pdg(AT)worldofnumbers.com), Jul 15 1998.

page 1

Search completed in 0.002 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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research