login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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; text; internal format)
OFFSET
1,3
LINKS
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
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)