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.

A060889 a(n) = n^8 - n^7 + n^5 - n^4 + n^3 - n + 1.

This page as a plain text file.
%I A060889 #23 Dec 20 2024 10:12:34
%S A060889 1,1,151,4561,49981,315121,1406371,4956001,14709241,38316961,90090991,
%T A060889 195019441,394379701,753327121,1370877691,2392743361,4027518961,
%U A060889 6566760001,10409530951,16092043921,24323047981,36025669681,52386445651,74912328481,105496487401,146493765601
%N A060889 a(n) = n^8 - n^7 + n^5 - n^4 + n^3 - n + 1.
%C A060889 a(n) = Phi_15(n) where Phi_k is the k-th cyclotomic polynomial.
%H A060889 Harry J. Smith, <a href="/A060889/b060889.txt">Table of n, a(n) for n=0..1000</a>
%H A060889 <a href="/index/Cy#CyclotomicPolynomialsValuesAtX">Index to values of cyclotomic polynomials of integer argument</a>
%H A060889 <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 A060889 G.f.: (1-8*x+178*x^2+3154*x^3+14410*x^4+16804*x^5+5458*x^6+322*x^7+x^8)/ (1-x)^9. - _Colin Barker_, Apr 21 2012
%p A060889 A060889 := proc(n)
%p A060889         numtheory[cyclotomic](15,n) ;
%p A060889 end proc:
%p A060889 seq(A060889(n),n=0..20) ; # _R. J. Mathar_, Feb 11 2014
%t A060889 Cyclotomic[15, Range[0, 30]] (* _Paolo Xausa_, Feb 26 2024 *)
%o A060889 (PARI) a(n) = { n^8 - n^7 + n^5 - n^4 + n^3 - n + 1 } \\ _Harry J. Smith_, Jul 14 2009
%K A060889 nonn,easy
%O A060889 0,3
%A A060889 _N. J. A. Sloane_, May 05 2001