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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A111136 a(n) = Sum_{k=1..n} Fibonacci(prime(k)). 2

%I

%S 1,3,8,21,110,343,1940,6121,34778,549007,1895276,26053093,191633234,

%T 625127671,3596342744,56912633917,1013634659958,3518365441919,

%U 48463935654772,356525456824901,1163040989874294,15635375014550515

%N a(n) = Sum_{k=1..n} Fibonacci(prime(k)).

%F a(n) = Sum_{i=1..n} A000045(A000040(i)). - _Wesley Ivan Hurt_, Feb 02 2014

%e The first 3 primes are 2, 3 and 5. So a(3) = F(2)+F(3)+F(5) = 1+2+5 = 8.

%p 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

%t f[n_] := Sum[ Fibonacci[ Prime[i]], {i, n}]; Array[f, 22] (* _Robert G. Wilson v_ *)

%Y Cf. A000040, A000045.

%K nonn

%O 1,2

%A _Leroy Quet_, Oct 17 2005

%E More terms from _Robert G. Wilson v_, Oct 21 2005

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 October 15 01:40 EDT 2019. Contains 328025 sequences. (Running on oeis4.)