id:A094830 - OEIS Search Results

Search: id:A094830

Displaying 1-1 of 1 results found.

page 1

Start with n, repeatedly replace x by x + sum of squares of digits of x until you reach a prime; sequence gives number of steps.

+0
4

1, 0, 0, 6, 0, 4, 0, 11, 5, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 5, 13, 9, 0, 4, 11, 12, 17, 3, 0, 8, 0, 8, 7, 1, 7, 3, 0, 5, 7, 4, 0, 3, 0, 3, 7, 8, 0, 2, 2, 2, 6, 3, 0, 10, 2, 3, 1, 3, 0, 3, 0, 2, 2, 18, 2, 11, 0, 2, 6, 9, 0, 10, 0, 1, 1, 2, 5, 1, 0, 16, 2, 8, 0, 3, 11, 6, 10, 2, 0, 4, 1, 15, 2, 1, 9, 2, 0, 7, 7, 1 (list; graph; listen)

	OFFSET	`1,4`
	EXAMPLE	`a(4)=6 because 4 -> 20 -> 24 -> 44 -> 76 -> 161 -> 199, takes 6 steps to reach a prime.`
	CROSSREFS	`Cf. A003132.` `Sequence in context: A019109 A089841 A019766 this_sequence A021947 A073010 A100120` `Adjacent sequences: A094827 A094828 A094829 this_sequence A094831 A094832 A094833`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Jun 13 2004`

page 1

Search completed in 0.002 seconds

Last modified November 22 20:51 EST 2009. Contains 167312 sequences.

AT&T Labs Research