Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A126973
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A126973 a(n+1) is the smallest integer greater than a(n) such that the sum of the squares of its digits is equal to a(n). +0
2
1, 10, 13, 23, 1233, 33999999999999999 (list; graph; listen)
OFFSET

1,2

EXAMPLE

10 --> 1^2+0^2 = 1+0 =1

13 --> 1^2+3^2 = 1+9 = 10

23 --> 2^2+3^2 = 4+9 =13

1233 --> 1^2+2^2+3^3+3^2 = 1+4+9+9 = 23

33999999999999999 = 3^2*2 + 9^2*15 = 1233

CROSSREFS

Cf. A001273, A053612.

Sequence in context: A001273 A111524 A074346 this_sequence A102249 A062370 A069960

Adjacent sequences: A126970 A126971 A126972 this_sequence A126974 A126975 A126976

KEYWORD

hard,nonn

AUTHOR

Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Mar 20 2007; corrected Mar 23 2007

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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research