This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A111136 a(n) = Sum_{k=1..n} Fibonacci(prime(k)). 2
 1, 3, 8, 21, 110, 343, 1940, 6121, 34778, 549007, 1895276, 26053093, 191633234, 625127671, 3596342744, 56912633917, 1013634659958, 3518365441919, 48463935654772, 356525456824901, 1163040989874294, 15635375014550515 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS FORMULA a(n) = Sum_{i=1..n} A000045(A000040(i)). - Wesley Ivan Hurt, Feb 02 2014 EXAMPLE The first 3 primes are 2, 3 and 5. So a(3) = F(2)+F(3)+F(5) = 1+2+5 = 8. MAPLE with(numtheory); with(combinat); A111136:=n->sum(fibonacci(ithprime(i)), i=1..n); seq(A111136(n), n=1..30); # Wesley Ivan Hurt, Feb 02 2014 MATHEMATICA f[n_] := Sum[ Fibonacci[ Prime[i]], {i, n}]; Array[f, 22] (* Robert G. Wilson v *) CROSSREFS Cf. A000040, A000045. Sequence in context: A192235 A148769 A156291 * A063937 A178525 A266187 Adjacent sequences:  A111133 A111134 A111135 * A111137 A111138 A111139 KEYWORD nonn AUTHOR Leroy Quet, Oct 17 2005 EXTENSIONS More terms from Robert G. Wilson v, Oct 21 2005 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.

Last modified July 21 00:49 EDT 2019. Contains 325189 sequences. (Running on oeis4.)