login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A059974 a(n)=a(p)+a(q) where p and q are the two primes less than n and closest to n; with a(1)=1, a(2)=1. 0
1, 1, 1, 2, 2, 3, 3, 5, 5, 5, 5, 8, 8, 13, 13, 13, 13, 21, 21, 34, 34, 34, 34, 55, 55, 55, 55, 55, 55, 89, 89, 144, 144, 144, 144, 144, 144, 233, 233, 233, 233, 377, 377, 610, 610, 610, 610, 987, 987, 987, 987, 987, 987, 1597, 1597, 1597, 1597, 1597, 1597, 2584 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

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

EXAMPLE

a(4)=a(3)+a(2)=1+1=2

MAPLE

with(numtheory): a := proc(n) option remember: if n <= 3 and n >=1 then RETURN(1) fi: a(prevprime(n))+ a(prevprime(prevprime(n))): end: for n from 1 to 150 do printf(`%d, `, a(n)) od:

CROSSREFS

Sequence in context: A033302 A072729 A057872 * A045767 A108221 A169682

Adjacent sequences:  A059971 A059972 A059973 * A059975 A059976 A059977

KEYWORD

easy,nonn

AUTHOR

Brian Wallace (wallacebrianedward(AT)yahoo.co.uk), Mar 05 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 01:29 EDT 2019. Contains 322237 sequences. (Running on oeis4.)