Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099771
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099771 Smallest n-aspiring number. That is, a(n) = smallest k such that s^(n)(k) is perfect but s^(n-1)(k) is not, where s(k) is the sum of the aliquot parts of k and s^(i) means iterate s i times. +0
1
25, 95, 417, 675, 2541, 3888, 3528, 16256, 13984, 11312, 10648, 10688, 6672, 15364, 20476, 12288, 12636, 32216, 33304, 33896, 34504, 38660, 31824, 15792, 62296, 67304, 49120, 58104, 102740, 82120, 84704, 53680 (list; graph; listen)
OFFSET

1,1

EXAMPLE

a(2) = 95 because s(s(95)) = s(25) = 6, which is perfect.

CROSSREFS

Cf. A063769.

Sequence in context: A090659 A010013 A063769 this_sequence A158547 A144854 A134422

Adjacent sequences: A099768 A099769 A099770 this_sequence A099772 A099773 A099774

KEYWORD

nonn

AUTHOR

Gabriel Cunningham (gcasey(AT)mit.edu), Nov 11 2004

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