This site is supported by donations to The OEIS Foundation.

Now is the time of year when we ask all users of the OEIS for their annual support.
Click here to donate to the OEIS Foundation using PayPal or in other ways.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A060883 n^6 + n^3 + 1. 20
 1, 3, 73, 757, 4161, 15751, 46873, 117993, 262657, 532171, 1001001, 1772893, 2987713, 4829007, 7532281, 11394001, 16781313, 24142483, 34018057, 47052741, 64008001, 85775383, 113390553, 148048057, 191116801, 244156251, 308933353 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Let Phi_k(x) be the k-th cyclotomic polynomial and form the sequence Phi_k(0), Phi_k(1), Phi_k(2), ... This gives A000027 (k=2), A002061 (k=3), A002522 (k=4), A053699 (k=5), A002061 (k=6), A053716 (k=7), A002523 (k=8), A060883 (k=9), A060884 (k=10), A060885 (k=11), A060886 (k=12), A060887 (k=13), A060888 (k=14), A060889 (k=15), A060890 (k=16), A060891 (k=18), A060892 (k=20), A060893 (k=24), A060894 (k=30), A060895 (k=32), A060896 (k=36). LINKS Harry J. Smith, Table of n, a(n) for n=0,...,1000 FORMULA 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] MAPLE with (combinat):seq(fibonacci(3, n^3)+n^3, n=0..30); - Zerinvary Lajos, May 25 2008 PROG (PARI) { for (n=0, 1000, write("b060883.txt", n, " ", n^6 + n^3 + 1); ) } [From Harry J. Smith, Jul 13 2009] CROSSREFS Sequence in context: A201038 A142078 A054689 * A162601 A173807 A093165 Adjacent sequences:  A060880 A060881 A060882 * A060884 A060885 A060886 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 | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .