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!)
A024459 a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (Lucas numbers). 0

%I #12 Sep 07 2023 16:36:14

%S 1,3,7,11,26,43,90,145,290,470,904,1462,2743,4439,8169,13217,23970,

%T 38785,69520,112485,199716,323148,569232,921036,1611661,2607723,

%U 4537195,7341335

%N a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (Lucas numbers).

%F Conjectured g.f.: x*(-1-2*x-x^2+3*x^3) / ( (x^2+1)*(x^2-x-1)*(x^2+x-1)^2 ). - _R. J. Mathar_, Apr 27 2020

%Y Cf. A000032, A000045.

%K nonn

%O 1,2

%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 16 00:06 EDT 2024. Contains 374343 sequences. (Running on oeis4.)