id:A096460 - OEIS Search Results

Search: id:A096460

Displaying 1-1 of 1 results found.

page 1

a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + sum of the unique prime factors of a(n).

+0
2

1, 2, 4, 6, 11, 22, 35, 47, 94, 143, 167, 334, 503, 1006, 1511, 3022, 4535, 5447, 5879, 11758, 17639, 18239, 18336, 18532, 18688, 18763, 19439, 22223, 22607, 22704, 22763, 22896, 22954, 23478, 23546, 23802, 27774, 29322, 29508, 31972, 39967 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..1000` `Gil Broussard, Sum of Unique Prime Factors Sequence. [Broken link]`
	EXAMPLE	`Given a(30)=22704 whose prime factorization is 2^4311*43, add to a(30) its unique prime factors (2+3+11+43)=59 to give a(31)=22704+59=22763.`
	CROSSREFS	`Sequence in context: A093970 A107428 A086379 this_sequence A084353 A084979 A049914` `Adjacent sequences: A096457 A096458 A096459 this_sequence A096461 A096462 A096463`
	KEYWORD	`nonn,nice`
	AUTHOR	`Gil Broussard (kikiriki(AT)mindspring.com), Aug 12 2004`
	EXTENSIONS	`Definition corrected May 10 2008`

page 1

Search completed in 0.002 seconds

Last modified November 24 19:42 EST 2009. Contains 167435 sequences.

AT&T Labs Research