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!)
A023615 Convolution of Fibonacci numbers and primes. 2

%I #14 Feb 23 2023 17:05:21

%S 2,5,12,24,47,84,148,251,422,702,1155,1894,3090,5027,8164,13244,21467,

%T 34772,56306,91149,147528,238756,386367,625212,1011676,1636989,

%U 2648768,4285864,6934741,11220718,18155586,29376435,47532158,76908732,124441039,201349922

%N Convolution of Fibonacci numbers and primes.

%H Robert Israel, <a href="/A023615/b023615.txt">Table of n, a(n) for n = 0..4775</a>

%F a(n) = Sum_{1<=k<=n+1} A000040(k)*A000045(n+2-k). - _Robert Israel_, Jan 18 2018

%F a(n) = a(n-1) + a(n-2) + prime(n+1). - _Alois P. Heinz_, Feb 19 2023

%p N:= 100: # to get a(0)..a(N)

%p G:= add(ithprime(i)*x^(i-1),i=1..N+1):

%p S:= series(G /(1-x-x^2),x,N+1):

%p seq(coeff(S,x,n),n=0..N); # _Robert Israel_, Jan 18 2018

%p # second Maple program:

%p a:= proc(n) option remember; `if`(n<0, 0,

%p a(n-1)+a(n-2)+ithprime(n+1))

%p end:

%p seq(a(n), n=0..35); # _Alois P. Heinz_, Feb 19 2023

%Y Cf. A000040, A000045, A023608.

%K nonn

%O 0,1

%A _Clark Kimberling_

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 July 22 03:15 EDT 2024. Contains 374479 sequences. (Running on oeis4.)