Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A046439
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A046439 9 steps needed to reach a prime under 'Sum of digits raised to its digits powers' procedure. +0
2
133, 138, 183, 303, 308, 313, 318, 330, 331, 380, 381, 389, 398, 446, 464, 644, 789, 798, 803, 813, 830, 831, 839, 879, 893, 897, 938, 978, 983, 987, 1005, 1015, 1024, 1042, 1046, 1050, 1051, 1064, 1105, 1115, 1124, 1142, 1146, 1150, 1151, 1164, 1204 (list; graph; listen)
OFFSET

0,1

CROSSREFS

Cf. A046431.

Sequence in context: A114534 A028674 A003915 this_sequence A031188 A102619 A020446

Adjacent sequences: A046436 A046437 A046438 this_sequence A046440 A046441 A046442

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 September 7 12:28 EDT 2008. Contains 143483 sequences.


AT&T Labs Research