login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060889 n^8-n^7+n^5-n^4+n^3-n+1. 4

%I #19 Feb 26 2024 14:27:00

%S 1,1,151,4561,49981,315121,1406371,4956001,14709241,38316961,90090991,

%T 195019441,394379701,753327121,1370877691,2392743361,4027518961,

%U 6566760001,10409530951,16092043921,24323047981,36025669681,52386445651

%N n^8-n^7+n^5-n^4+n^3-n+1.

%C a(n) = Phi_15(n) where Phi_k is the k-th cyclotomic polynomial.

%H Harry J. Smith, <a href="/A060889/b060889.txt">Table of n, a(n) for n=0..1000</a>

%H <a href="/index/Cy#CyclotomicPolynomialsValuesAtX">Index to values of cyclotomic polynomials of integer argument</a>

%H <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 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 := proc(n)

%p numtheory[cyclotomic](15,n) ;

%p end proc:

%p seq(A060889(n),n=0..20) ; # _R. J. Mathar_, Feb 11 2014

%t Cyclotomic[15, Range[0, 30]] (* _Paolo Xausa_, Feb 26 2024 *)

%o (PARI) { for (n=0, 1000, write("b060889.txt", n, " ", n^8 - n^7 + n^5 - n^4 + n^3 - n + 1); ) } \\ _Harry J. Smith_, Jul 14 2009

%K nonn,easy

%O 0,3

%A _N. J. A. Sloane_, May 05 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 12:33 EDT 2024. Contains 371969 sequences. (Running on oeis4.)