Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101335
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A101335
%S A101335 136,244,2178,6514,58618,76438,2755907,6586433,8139850,9057586
%N 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.
%D A101335 Ken Follett, Code to Zero, Dutton, NY 2000, p. 84.
%F A101335 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))).
%e A101335 1^3+3^3+6^3=244 => 2^3+4^3+4^3=136.
%t A101335 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)
%Y A101335 Cf. A005188.
%Y A101335 Sequence in context: A072889 A157714 A165337 this_sequence A098215 A116223 
               A124241
%Y A101335 Adjacent sequences: A101332 A101333 A101334 this_sequence A101336 A101337 
               A101338
%K A101335 nonn,base
%O A101335 1,1
%A A101335 Allyson A. Wilson (Foxtail(AT)southwind.net), May 04 2005

    
page 1

Search completed in 0.001 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 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research