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.
%I A050483 #19 Feb 15 2022 09:57:13
%S A050483 1,11,60,228,690,1782,4092,8580,16731,30745,53768,90168,145860,228684,
%T A050483 348840,519384,756789,1081575,1519012,2099900,2861430,3848130,5112900,
%U A050483 6718140,8736975,11254581,14369616,18195760,22863368,28521240,35338512,43506672,53241705,64786371
%N A050483 Partial sums of A051947.
%D A050483 Albert H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 194-196.
%H A050483 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (8,-28,56,-70,56,-28,8,-1).
%F A050483 a(n) = C(n+6, 6)*(4n+7)/7.
%F A050483 G.f.: (1+3*x)/(1-x)^8. - proposed by Maksym Voznyy checked and corrected by _R. J. Mathar_, Sep 16 2009
%F A050483 Sum_{n>=0} 1/a(n) = 57344*Pi/663 - 114688*log(2)/221 + 295372/3315. - _Amiram Eldar_, Feb 15 2022
%t A050483 Table[(4*n + 7)*Binomial[n + 6, 6]/7, {n, 0, 40}] (* _Amiram Eldar_, Feb 15 2022 *)
%Y A050483 Cf. A051947.
%Y A050483 Cf. A093561 ((4, 1) Pascal, column m=7).
%K A050483 easy,nonn
%O A050483 0,2
%A A050483 _Barry E. Williams_, Dec 26 1999