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!)
A024463 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 = (odd natural numbers). 0

%I #6 Apr 27 2020 12:05:28

%S 1,3,8,12,26,34,63,77,136,160,272,312,521,587,968,1076,1762,1938,3159,

%T 3445,5600,6064,9840,10592,17169,18387,29784,31756,51418,54610,88399,

%U 93565,151432,159792,258592,272120,440345,462235,747960,783380,1267586

%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 = (odd natural numbers).

%H <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (2,1,-4,3,-2,-1,4,-3,2,-1).

%F G.f.:(1-5*x^5+3*x^4-3*x^3+x^2+x)/((x-1)^2*(x^4+x^2-1)^2) [From Maksym Voznyy (voznyy(AT)mail.ru), Jul 27 2009]

%K nonn,easy

%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 June 7 20:32 EDT 2023. Contains 363157 sequences. (Running on oeis4.)