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

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035502 Lower of pair of consecutive happy numbers. 4
31, 129, 192, 262, 301, 319, 367, 391, 565, 622, 637, 655, 912, 931, 1029, 1092, 1114, 1121, 1151, 1184, 1211, 1221, 1257, 1274, 1299, 1332, 1447, 1474, 1511, 1527, 1574, 1581, 1724, 1744, 1754, 1771, 1784, 1814, 1851, 1874, 1880, 1881, 1902, 1929, 2062 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

REFERENCES

R. K. Guy, Unsolved Problems Number Theory, Sect. E34.

LINKS

Table of n, a(n) for n=1..45.

Eric Weisstein's World of Mathematics, Happy Number

MATHEMATICA

f[n_] := Total[IntegerDigits[n]^2]; t = Select[Range[5000], NestWhile[f, #, UnsameQ, All] == 1 &]; t[[Select[Range[Length[t] - 1],  t[[#]] == t[[# + 1]] - 1 &]]] (* T. D. Noe, Aug 23 2011 *)

CROSSREFS

Cf. A007770, A035503.

Sequence in context: A079141 A049203 A065403 * A183838 A043355 A023728

Adjacent sequences:  A035499 A035500 A035501 * A035503 A035504 A035505

KEYWORD

nonn,easy,base

AUTHOR

N. J. A. Sloane.

EXTENSIONS

More terms from Sascha Kurz, Mar 24 2002

STATUS

approved

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

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

Last modified November 28 01:41 EST 2014. Contains 250286 sequences.