Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A094406
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A094406 Smallest unhappy number that takes n steps to reach any of the unhappy cycle (4, 16, 37, 58, 89, 145, 42, 20) under iteration of sum of squares of digits map. +0
1
4, 2, 11, 15, 5, 3, 14, 45, 36, 6, 112, 269, 15999 (list; graph; listen)
OFFSET

4,1

COMMENT

This sequence is an analogue of sequence A001273 with the unhappy numbers instead of the happy numbers.

LINKS

W. Schneider, Unhappy Numbers.

EXAMPLE

15 is the fourth term because: 15: 1^2 + 5^2 = 26 / 26: 2^2 + 6^2 = 40 / 40: 4^2 + 0^2 = 16 and 16 is a member of the unhappy number series (4, 16, 37, 58, 89, 145, 42, 20)

CROSSREFS

Cf. A001273.

Sequence in context: A128781 A135440 A091484 this_sequence A092952 A010318 A137447

Adjacent sequences: A094403 A094404 A094405 this_sequence A094407 A094408 A094409

KEYWORD

nonn

AUTHOR

Sergio Pimentel (ferdiego(AT)cox-internet.com), Apr 30 2004

EXTENSIONS

The next term, 577999999999....999999999999 (199 digits) is too large to include.

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 July 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research