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

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

%I #9 Feb 03 2018 02:32:39

%S 4,6,19,31,70,113,223,361,662,1071,1880,3042,5194,8404,14093,22803,

%T 37786,61139,100509,162627,265932,430287,701120,1134436,1844096,

%U 2983810,4842711,7835671,12703934,20555397,33303259,53885805,87264322,141196639,228589496

%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 >= 2), t = (F(2), F(3), F(4), ...).

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

%t LinearRecurrence[{1,3,-2,-1,-1,-3,2,1,1,1},{4,6,19,31,70,113,223,361,662,1071},30] (* _Harvey P. Dale_, Feb 03 2018 *)

%K nonn

%O 2,1

%A _Clark Kimberling_

%E More terms from _Harvey P. Dale_, Feb 03 2018

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 23 23:35 EDT 2023. Contains 365554 sequences. (Running on oeis4.)