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.

A050404 Partial sums of A051878.

This page as a plain text file.
%I A050404 #22 Sep 08 2022 08:44:58
%S A050404 1,14,77,280,798,1932,4158,8184,15015,26026,43043,68432,105196,157080,
%T A050404 228684,325584,454461,623238,841225,1119272,1469930,1907620,2448810,
%U A050404 3112200,3918915,4892706,6060159,7450912
%N A050404 Partial sums of A051878.
%D A050404 A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 194-196.
%H A050404 G. C. Greubel, <a href="/A050404/b050404.txt">Table of n, a(n) for n = 0..1000</a>
%H A050404 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (7,-21,35,-35,21,-7,1).
%F A050404 a(n) = binomial(n+5, 5)*(4*n+3)/3.
%F A050404 G.f.: (1+7*x)/(1-x)^7.
%F A050404 E.g.f.: (360 +4680*x +9000*x^2 +5400*x^3 +1275*x^4 +123*x^5 +4*x^6 )*exp(x)/360. - _G. C. Greubel_, Aug 30 2019
%p A050404 seq((4*n+3)*binomial(n+5,5)/3, n=0..40); # _G. C. Greubel_, Aug 30 2019
%t A050404 Table[(4*n+3)*Binomial[n+5,5]/3, {n,0,40}] (* _Vladimir Joseph Stephan Orlovsky_, Apr 19 2011, modified by _G. C. Greubel_, Aug 30 2019 *)
%o A050404 (PARI) vector(40, n, (4*n-1)*binomial(n+4,5)/3) \\ _G. C. Greubel_, Aug 30 2019
%o A050404 (Magma) [(4*n+3)*Binomial(n+5,5)/3: n in [0..40]]; // _G. C. Greubel_, Aug 30 2019
%o A050404 (Sage) [(4*n+3)*binomial(n+5,5)/3 for n in (0..30)] # _G. C. Greubel_, Aug 30 2019
%o A050404 (GAP) List([0..40], n-> (4*n+3)*Binomial(n+5,5)/3); # _G. C. Greubel_, Aug 30 2019
%Y A050404 Cf. A051878.
%Y A050404 Cf. A093565 ((8, 1) Pascal, column m=6).
%K A050404 easy,nonn
%O A050404 0,2
%A A050404 _Barry E. Williams_, Dec 21 1999
%E A050404 Corrected by _T. D. Noe_, Nov 09 2006