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!)
A301715 Partial sums of A301714. 1

%I #12 Aug 30 2023 15:16:54

%S 1,6,18,34,55,83,114,152,196,243,299,358,422,494,567,649,736,826,926,

%T 1027,1135,1250,1366,1492,1621,1755,1898,2042,2194,2351,2511,2680,

%U 2852,3030,3215,3403,3598,3798,4002,4213,4429,4650,4878,5110,5347,5591,5838,6092,6352,6615,6887,7162,7442,7730,8019,8317,8620

%N Partial sums of A301714.

%C Linear recurrence and g.f. confirmed by Shutov/Maleev link in A301714. - _Ray Chandler_, Aug 30 2023

%H Ray Chandler, <a href="/A301715/b301715.txt">Table of n, a(n) for n = 0..1000</a>

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

%F From _Colin Barker_, Apr 09 2018: (Start)

%F G.f.: (1 + 4*x + 7*x^2 + 4*x^3 + 6*x^4 + 10*x^5 + 6*x^6 + 4*x^7 + 7*x^8 + 4*x^9+ x^10) / ((1 - x)^3*(1 + x^4)*(1 + x + x^2 + x^3 + x^4)).

%F a(n) = 2*a(n-1) - a(n-2) - a(n-4) + 3*a(n-5) - 3*a(n-6) + a(n-7) + a(n-9) - 2*a(n-10) + a(n-11) for n>10.

%F (End)

%Y Cf. A301714.

%K nonn

%O 0,2

%A _N. J. A. Sloane_, Mar 26 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 15:57 EDT 2024. Contains 371961 sequences. (Running on oeis4.)