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 A270871 #21 Dec 17 2023 18:31:32
%S A270871 8,691,5030,25511,100372,324323,898706,2206135,4914656,10116467,
%T A270871 19506238,35604071,62028140,103822051,167841962,263208503,401828536,
%U A270871 598991795,874047446,1251165607,1760188868,2437578851,3327462850,4482785591,5966571152,7853300083
%N A270871 a(n) = n^7 + 6*n^6 + 26*n^5 + 73*n^4 + 152*n^3 + 222*n^2 + 203*n + 8.
%H A270871 Vincenzo Librandi, <a href="/A270871/b270871.txt">Table of n, a(n) for n = 0..1000</a>
%H A270871 Andrew Misseldine, <a href="http://arxiv.org/abs/1508.03757">Counting Schur Rings over Cyclic Groups</a>, arXiv preprint arXiv:1508.03757 [math.RA], 2015. (page 19, 4th row; page 21, 7th row).
%H A270871 <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 A270871 G.f.: (8 + 627*x - 274*x^2 + 4171*x^3 - 1012*x^4 + 1897*x^5 - 450*x^6 + 73*x^7)/(1 - x)^8.
%F A270871 a(n) = 8*a(n-1) - 28*a(n-2) + 56*a(n-3) - 70*a(n-4) + 56*a(n-5) - 28*a(n-6) + 8*a(n-7) - a(n-8).
%t A270871 Table[n^7 + 6 n^6 + 26 n^5 + 73 n^4 + 152 n^3 + 222 n^2 + 203 n + 8, {n, 0, 40}]
%t A270871 LinearRecurrence[{8,-28,56,-70,56,-28,8,-1},{8,691,5030,25511,100372,324323,898706,2206135},30] (* _Harvey P. Dale_, Dec 17 2023 *)
%o A270871 (Magma) [n^7+6*n^6+26*n^5+73*n^4+152*n^3+222*n^2+203*n+8: n in [0..40]];
%o A270871 (PARI) x='x+O('x^99); Vec((8+627*x-274*x^2+4171*x^3-1012*x^4+1897*x^5-450*x^6+73*x^7) / (1-x)^8) \\ _Altug Alkan_, Apr 03 2016
%Y A270871 Cf. A270867, A270868. A270869, A270870.
%K A270871 nonn,easy
%O A270871 0,1
%A A270871 _Vincenzo Librandi_, Apr 03 2016