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 A060883 #31 Aug 17 2024 03:23:13 %S A060883 1,3,73,757,4161,15751,46873,117993,262657,532171,1001001,1772893, %T A060883 2987713,4829007,7532281,11394001,16781313,24142483,34018057,47052741, %U A060883 64008001,85775383,113390553,148048057,191116801,244156251,308933353 %N A060883 a(n) = n^6 + n^3 + 1. %C A060883 a(n) = Phi_9(n) where Phi_k is the k-th cyclotomic polynomial. %H A060883 Harry J. Smith, <a href="/A060883/b060883.txt">Table of n, a(n) for n = 0..1000</a> %H A060883 <a href="/index/Cy#CyclotomicPolynomialsValuesAtX">Index to values of cyclotomic polynomials of integer argument</a> %H A060883 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (7,-21,35,-35,21,-7,1). %F A060883 G.f.: (1-4*x+73*x^2+274*x^3+325*x^4+50*x^5+x^6)/(1-x)^7. [_Colin Barker_, Apr 21 2012] %p A060883 A060883 := proc(n) %p A060883 numtheory[cyclotomic](9,n) ; %p A060883 end proc: %p A060883 seq(A060883(n),n=0..20) ; # _R. J. Mathar_, Feb 07 2014 %t A060883 Table[n^6+n^3+1,{n,0,30}] (* or *) LinearRecurrence[{7,-21,35,-35,21,-7,1},{1,3,73,757,4161,15751,46873},30] (* _Harvey P. Dale_, Jul 07 2019 *) %o A060883 (PARI) a(n)={n^6 + n^3 + 1} \\ _Harry J. Smith_, Jul 13 2009 %K A060883 nonn,easy %O A060883 0,2 %A A060883 _N. J. A. Sloane_, May 05 2001