id:A029913 - OEIS Search Results

Search: id:A029913

Displaying 1-1 of 1 results found.

page 1

Start with n; if prime, stop; repeatedly sum squares of prime factors (counted with multiplicity), until reach 16 or a prime; set a(n) = 0 if no limit exists.

+0
2

2, 3, 17, 5, 13, 7, 17, 59, 29, 11, 17, 13, 53, 293, 16, 17, 16, 19, 16, 16, 16, 23, 16, 16, 16, 16, 16, 29, 16, 31, 16, 16, 16, 16, 16, 37, 16, 16, 16, 41, 16, 43, 16, 16, 16, 47, 16, 16, 16, 16, 16, 53, 16, 16, 16, 16, 16, 59, 16, 61, 16, 16, 16, 16, 16, 67, 16, 16, 16, 71 (list; graph; listen)

	OFFSET	`2,1`
	EXAMPLE	`9 -> 3^2+3^2 = 18 -> 4+9+9 = 22 -> 4+121 = 125 -> 25+25+25 = 75 -> 9+25+25 = 59, so a(9) = 59.`
	CROSSREFS	`Cf. A029914.` `Sequence in context: A005273 A103898 A140383 this_sequence A029914 A073125 A171240` `Adjacent sequences: A029910 A029911 A029912 this_sequence A029914 A029915 A029916`
	KEYWORD	`nonn`
	AUTHOR	`Dann Toliver (fsdrt(AT)hotmail.com)`
	EXTENSIONS	`More terms from Michel ten Voorde (seqfan(AT)tenvoorde.org) Apr 12 2001`

page 1

Search completed in 0.002 seconds

Last modified March 20 09:10 EDT 2010. Contains 173642 sequences.

AT&T Labs Research