|
| |
|
|
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
|
|
0
| |
|
|
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; refs; listen; history; internal format)
|
|
|
|
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: A077982 A185816 A099427 * A087458 A052180 A065151
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 (sellersj(AT)math.psu.edu), Mar 15 2001
|
| |
|
|
