id:A128215 - OEIS Search Results

Search: id:A128215

Displaying 1-1 of 1 results found.

page 1

a(1)=a(2)=1. a(n+1) = a(n) + a(largest prime dividing n).

+0
2

1, 1, 2, 4, 5, 10, 12, 24, 25, 27, 32, 64, 66, 132, 144, 149, 150, 300, 302, 604, 609, 621, 653, 1306, 1308, 1313, 1379, 1381, 1393, 2786, 2791, 5582, 5583, 5615, 5765, 5777, 5779, 11558, 11860, 11926, 11931, 23862, 23874, 47748, 47780, 47785, 48438, 96876 (list; graph; listen)

	OFFSET	`1,3`
	EXAMPLE	`The largest prime dividing 12 is 3. So a(13) = a(12) + a(3) = 64 + 2 = 66.`
	MAPLE	`with(numtheory): a[1]:=1:a[2]:=1:for n from 2 to 55 do a[n+1]:=a[n]+a[factorset(n)[nops(factorset(n))]] od: seq(a[n], n=1..55); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 07 2007`
	CROSSREFS	`Cf. A128216, A006530.` `Sequence in context: A120491 A022944 A133732 this_sequence A097132 A013578 A105138` `Adjacent sequences: A128212 A128213 A128214 this_sequence A128216 A128217 A128218`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com), Feb 19 2007`
	EXTENSIONS	`More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 07 2007`

page 1

Search completed in 0.002 seconds

Last modified September 6 00:03 EDT 2008. Contains 143485 sequences.

AT&T Labs Research