The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A024877 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers >= 3), t = (Lucas numbers). 0

%I #9 Jan 23 2017 16:27:01

%S 9,12,37,61,133,214,413,669,1208,1954,3394,5492,9309,15062,25131,

%T 40663,67147,108646,178181,288303,470670,761560,1239524,2005592,

%U 3257761,5271168,8550753

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

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

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

%t LinearRecurrence[{1,3,-2,-1,-1,-3,2,1,1,1},{9,12,37,61,133,214,413,669,1208,1954},30] (* _Harvey P. Dale_, Jan 23 2017 *)

%K nonn

%O 2,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.

Last modified September 22 00:10 EDT 2023. Contains 365503 sequences. (Running on oeis4.)