[go: up one dir, main page]

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!)
A106515 A Fibonacci-Pell convolution. 4
1, 2, 6, 15, 38, 94, 231, 564, 1372, 3329, 8064, 19512, 47177, 114010, 275430, 665247, 1606534, 3879302, 9366735, 22615356, 54601628, 131825377, 318263328, 768369744, 1855031473, 4478479058, 10812064614, 26102729679, 63017720390 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Diagonal sums of A106513.
LINKS
FORMULA
G.f.: (1-x)/((1-x-x^2)*(1-2*x-x^2)).
a(n) = Sum_{k=0..n} Fibonacci(n-k-1)*Pell(k+1).
a(n) = Sum_{k=0..floor(n/2)} Sum_{j=0..floor((n-k+1)/2)} binomial(n-k+1, 2*j+k+1)*2^j.
a(n) = Pell(n) + Pell(n+1) - Fibonacci(n). - Ralf Stephan, Jun 02 2007
a(n) = 3*a(n-1) - 3*a(n-3) - a(n-4). - Wesley Ivan Hurt, May 27 2021
MATHEMATICA
Table[Fibonacci[n, 2] + Fibonacci[n+1, 2] - Fibonacci[n], {n, 0, 30}] (* Vladimir Reshetnikov, Sep 27 2016 *)
PROG
(Magma)
Pell:= func< n | Round(((1+Sqrt(2))^n - (1-Sqrt(2))^n)/(2*Sqrt(2))) >;
[Pell(n) + Pell(n+1) - Fibonacci(n): n in [0..30]]; // G. C. Greubel, Aug 05 2021
(Sage) [lucas_number1(n+1, 2, -1) + lucas_number1(n, 2, -1) - lucas_number1(n, 1, -1) for n in (0..30)] # G. C. Greubel, Aug 05 2021
CROSSREFS
Sequence in context: A034518 A260787 A290762 * A153122 A109545 A191634
KEYWORD
easy,nonn
AUTHOR
Paul Barry, May 05 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 15:03 EDT 2024. Contains 375517 sequences. (Running on oeis4.)