login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060892 n^8-n^6+n^4-n^2+1. 2
1, 1, 205, 5905, 61681, 375601, 1634221, 5649505, 16519105, 42521761, 99009901, 212601841, 427016305, 810932305, 1468297741, 2551550401, 4278255361, 6951703105, 10986053005, 16936647121, 25536159601, 37737287281, 54762727405, 78163228705, 109884542401 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

a(n) = Phi_20(n) where Phi_k(x) is the k-th cyclotomic polynomial.

LINKS

Harry J. Smith, Table of n, a(n) for n=0,...,1000

Index to values of cyclotomic polynomials of integer argument

Index entries for linear recurrences with constant coefficients, signature (9, -36, 84, -126, 126, -84, 36, -9, 1).

FORMULA

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]

MAPLE

A060892 := proc(n)

        numtheory[cyclotomic](20, n) ;

end proc:

seq(A060892(n), n=0..20) ; # R. J. Mathar, Feb 11 2014

PROG

(PARI) { for (n=0, 1000, write("b060892.txt", n, " ", n^8 - n^6 + n^4 - n^2 + 1); ) } \\ Harry J. Smith, Jul 14 2009

CROSSREFS

Sequence in context: A203889 A226564 A077457 * A203862 A289333 A015289

Adjacent sequences:  A060889 A060890 A060891 * A060893 A060894 A060895

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, May 05 2001

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 15 15:01 EST 2019. Contains 329999 sequences. (Running on oeis4.)