Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072897
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072897 Least n-th order digital invariant which is not an Armstrong number (A005188). +0
1
136, 2178, 58618, 63804, 2755907 (list; graph; listen)
OFFSET

3,1

COMMENT

An n-th order digital invariant is a number such that the sum of the n-th power of the integer digits of n equals some number k and the sum of the n-th power of the integer digits of k equals n. An Armstrong number is where n = k.

REFERENCES

David Wells, The Penguin Dictionary of Curious and Interesting Numbers, Revised Edition, London, England, 1997, pgs. 124&155.

LINKS

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

MATHEMATICA

Do[k = 1; While[ !(Apply[Plus, IntegerDigits[Apply[Plus, IntegerDigits[k]^n]]^n] == k && Apply[Plus, IntegerDigits[k]^n] != k), k++ ]; Print[k], {n, 3, 7}]

CROSSREFS

Cf. A072409 and A005188.

Sequence in context: A076331 A023070 A015163 this_sequence A071231 A035819 A157880

Adjacent sequences: A072894 A072895 A072896 this_sequence A072898 A072899 A072900

KEYWORD

hard,nonn,base

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 09 2002

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 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research