id:A059964 - OEIS Search Results

Search: id:A059964

Displaying 1-1 of 1 results found.

page 1

a(1) = 1, a(2) = 1, a(n) = a(n-p) + a((n+1)-p), n > 2, where p is the largest prime less than n

+0
1

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

	OFFSET	`1,3`
	EXAMPLE	`a(16)=a(16-13)+a(17-13)=a(3)+a(4)=2+2=4`
	MAPLE	with(numtheory): a := proc(n) option remember: if n <= 2 and n >=1 then RETURN(1) fi: a(n-prevprime(n))+ a(n+1-prevprime(n)): end: for n from 1 to 250 do printf(`%d, `, a(n)) od:
	CROSSREFS	`Sequence in context: A073855 A077982 A099427 this_sequence A087458 A052180 A065151` `Adjacent sequences: A059961 A059962 A059963 this_sequence A059965 A059966 A059967`
	KEYWORD	`nonn`
	AUTHOR	`Brian Wallace (wallacebrianedward(AT)yahoo.co.uk), Mar 04 2001`
	EXTENSIONS	`More terms from James A. Sellers (sellersj(AT)math.psu.edu), Mar 15 2001`

page 1

Search completed in 0.002 seconds

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.

AT&T Labs Research