A059964 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.

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

Offset

1,3

Links

Table of n, a(n) for n=1..105.

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: A324901 A295568 A099427 * A308050 A248147 A087458

Adjacent sequences: A059961 A059962 A059963 * A059965 A059966 A059967

Keyword

nonn

Author

Brian Wallace (wallacebrianedward(AT)yahoo.co.uk), Mar 04 2001

Extensions

More terms from James A. Sellers, Mar 15 2001

Status

approved