Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A033841
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A033841
%S A033841 2,41,27,353,243,36804,2187,6287267,19683,403584750,177147,42256814922,
%T A033841 1594323,1447031689954,14348907,320659684133768,129140163,
%U A033841 117025292105903,1162261467,170554117891588216,10460353203
%N A033841 Smallest number > 1 equal to sum of n-th powers of its base 9 digits, 
               or 0 if no such number (written in base 10).
%H A033841 Joseph Myers, <a href="b033841.txt">Table of n, a(n) for n=1..125</a> 
               [From Joseph Myers (jsm(AT)polyomino.org.uk), Jul 07 2009]
%Y A033841 Cf. A162234, A162235, A162236. In other bases: A033835 (base 3), A033836 
               (base 4), A033837 (base 5), A033838 (base 6), A033839 (base 7), A033840 
               (base 8), A003321 (base 10). [From Joseph Myers (jsm(AT)polyomino.org.uk), 
               Jul 07 2009]
%Y A033841 Sequence in context: A162868 A059476 A062769 this_sequence A107194 A154767 
               A042923
%Y A033841 Adjacent sequences: A033838 A033839 A033840 this_sequence A033842 A033843 
               A033844
%K A033841 nonn,base
%O A033841 1,1
%A A033841 David W. Wilson (davidwwilson(AT)comcast.net)
%E A033841 Extended by Joseph Myers (jsm(AT)polyomino.org.uk), Jul 07 2009

    
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 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research