cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A365417 Partial sums of A265036.

This page as a plain text file.
%I A365417 #11 Sep 03 2023 13:46:32
%S A365417 1,5,11,18,28,42,62,86,110,133,159,193,235,279,319,356,398,452,516,
%T A365417 580,636,687,745,819,905,989,1061,1126,1200,1294,1402,1506,1594,1673,
%U A365417 1763,1877,2007,2131,2235,2328,2434,2568,2720,2864,2984,3091,3213,3367,3541,3705,3841,3962,4100,4274,4470,4654
%N A365417 Partial sums of A265036.
%H A365417 Ray Chandler, <a href="/A365417/b365417.txt">Table of n, a(n) for n = 0..1000</a>
%H A365417 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (5,-12,18,-18,12,-5,1).
%F A365417 G.f.: (2*x^9 - 6*x^8 + 8*x^7 - 7*x^6 + 2*x^5 + 2*x^4 - 5*x^3 + 2*x^2 - 1)/((x - 1)^3*(x^2 - x + 1)^2).
%F A365417 a(n) = 5*a(n-1) - 12*a(n-2) + 18*a(n-3) - 18*a(n-4) + 12*a(n-5) - 5*a(n-6) + a(n-7) for n > 10.
%t A365417 Join[{1,5,11},LinearRecurrence[{5, -12, 18, -18, 12, -5, 1},{18, 28, 42, 62, 86, 110, 133},50]]
%Y A365417 Cf. A265036.
%K A365417 nonn,easy
%O A365417 0,2
%A A365417 _Ray Chandler_, Sep 03 2023