login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A101335 n-digit numbers not equal to sum of k-th powers of their digits (A005188), but equal to the sum of k-th powers of their digits nested once. 0
136, 244, 2178, 6514, 58618, 76438, 2755907, 6586433, 8139850, 9057586 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

REFERENCES

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

FORMULA

Let n = d_1 d_2 ... d_k in base 10; then f(n) = Sum_{i=1..k} d_i^k. a(n) # f(a(n)) but a(n) = f(f(a(n))).

EXAMPLE

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

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}] (from Robert G. Wilson v (rgwv(AT)rgwv.com), May 21 2005)

CROSSREFS

Cf. A005188.

Sequence in context: A072889 A157714 A165337 * A098215 A183635 A116223

Adjacent sequences:  A101332 A101333 A101334 * A101336 A101337 A101338

KEYWORD

nonn,base

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 03:33 EST 2012. Contains 205694 sequences.