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

%I #6 Apr 27 2020 12:09:18

%S 1,3,14,22,50,66,131,161,290,342,592,680,1145,1291,2142,2382,3914,

%T 4306,7035,7673,12490,13526,21968,23648,38353,41075,66558,70966,

%U 114930,122066,197619,209169,338562,357254,578176,608424,984585,1033531,1672430,1751630,2834346

%N a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas 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-6*x^7+2*x^6-7*x^5+x^4-5*x^3+7*x^2+x)/((x-1)^2*(x^4+x^2-1)^2) [From Maksym Voznyy (voznyy(AT)mail.ru), Jul 27 2009]

%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 April 25 04:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)