login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A101335 Let n = d_1 d_2 ... d_k in base 10 and f(n) = Sum_{i=1..k} d_i^k; sequence gives numbers n such that n != f(n) but n = f(f(n)). 1
136, 244, 2178, 6514, 58618, 76438, 2755907, 6586433, 8139850, 9057586, 277668893, 756738746, 21914086555935085, 37878721692554416, 187864919457180831, 375609204308055082, 13397885590701080090, 40091536165423401387, 108493282045082839040458, 183144838903847612823687 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

REFERENCES

Ken Follett, Code to Zero, Dutton, NY 2000, p. 84.

LINKS

Tim Johannes Ohrtmann, Table of n, a(n) for n = 1..32

EXAMPLE

136 => 1^3+3^3+6^3=244 => 2^3+4^3+4^3=136.

2178 => 2^4+1^4+7^4+8^4=6514 => 6^4+5^4+1^4+4^4=2178.

MATHEMATICA

f[n_] := Plus @@ (IntegerDigits[n]^Floor[Log[10, n] + 1]); Do[ lst = NestList[f, n, 2]; If[lst[[1]] == lst[[3]] != lst[[2]], Print[n]], {n, 110000000}] (* Robert G. Wilson v, May 21 2005 *)

CROSSREFS

Cf. A005188.

Subsequence of A157714.

Sequence in context: A264951 A264958 A262615 * A098215 A247439 A183635

Adjacent sequences:  A101332 A101333 A101334 * A101336 A101337 A101338

KEYWORD

nonn,base,fini

AUTHOR

Allyson A. Wilson (Foxtail(AT)southwind.net), May 04 2005

EXTENSIONS

a(11)-a(20) from Tim Johannes Ohrtmann, Aug 27 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 27 10:15 EST 2020. Contains 332304 sequences. (Running on oeis4.)