id:A090425 - OEIS Search Results

Search: id:A090425

Displaying 1-1 of 1 results found.

page 1

Number of iterations required for happy number A007770(n) to converge to 1.

+0
1

1, 6, 2, 3, 5, 4, 4, 3, 4, 5, 5, 3, 6, 4, 4, 3, 5, 5, 4, 2, 3, 5, 4, 3, 6, 6, 4, 4, 5, 5, 4, 6, 4, 4, 4, 6, 4, 6, 6, 6, 6, 4, 4, 6, 3, 4, 3, 6, 6, 4, 6, 6, 6, 5, 7, 6, 7, 6, 6, 6, 7, 5, 6, 6, 6, 7, 5, 5, 5, 4, 4, 7, 5, 5, 5, 7, 7, 4, 7, 4, 5, 3, 4, 6, 6, 6, 7, 6, 6, 4, 7, 7, 4, 5, 5, 4, 6, 3, 6, 7, 6, 4 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`The count includes both the start and end.`
	LINKS	`Eric Weisstein's World of Mathematics, Happy Number`
	EXAMPLE	`7 is the 2nd happy number and iterated digit squarings and additions give the sequence {7,49,97,130,10,1}, so a(2)=6.`
	CROSSREFS	`Cf. A007770.` `Adjacent sequences: A090422 A090423 A090424 this_sequence A090426 A090427 A090428` `Sequence in context: A019662 A134105 A011362 this_sequence A086048 A064925 A084945`
	KEYWORD	`nonn`
	AUTHOR	`Eric Weisstein (eric(AT)weisstein.com), Nov 30, 2003`

page 1

Search completed in 0.002 seconds

Last modified October 10 20:39 EDT 2008. Contains 144831 sequences.

AT&T Labs Research