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.

A060892 a(n) = n^8 - n^6 + n^4 - n^2 + 1.

This page as a plain text file.
%I A060892 #24 Feb 26 2024 14:37:10
%S A060892 1,1,205,5905,61681,375601,1634221,5649505,16519105,42521761,99009901,
%T A060892 212601841,427016305,810932305,1468297741,2551550401,4278255361,
%U A060892 6951703105,10986053005,16936647121,25536159601,37737287281,54762727405,78163228705,109884542401
%N A060892 a(n) = n^8 - n^6 + n^4 - n^2 + 1.
%C A060892 a(n) = Phi_20(n) where Phi_k(x) is the k-th cyclotomic polynomial.
%H A060892 Harry J. Smith, <a href="/A060892/b060892.txt">Table of n, a(n) for n=0..1000</a>
%H A060892 <a href="/index/Cy#CyclotomicPolynomialsValuesAtX">Index to values of cyclotomic polynomials of integer argument</a>
%H A060892 <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (9,-36,84,-126,126,-84,36,-9,1).
%F A060892 G.f.: (1-8*x+232*x^2+4012*x^3+15958*x^4+15832*x^5+4096*x^6+196*x^7+x^8)/ (1-x)^9. [_Colin Barker_, Apr 22 2012]
%p A060892 A060892 := proc(n)
%p A060892         numtheory[cyclotomic](20,n) ;
%p A060892 end proc:
%p A060892 seq(A060892(n),n=0..20) ; # _R. J. Mathar_, Feb 11 2014
%t A060892 Cyclotomic[20, Range[0, 30]] (* _Paolo Xausa_, Feb 26 2024 *)
%o A060892 (PARI) a(n) = n^8 - n^6 + n^4 - n^2 + 1; \\ _Harry J. Smith_, Jul 14 2009
%K A060892 nonn,easy
%O A060892 0,3
%A A060892 _N. J. A. Sloane_, May 05 2001