|
Search: id:A060888
|
|
|
| A060888 |
|
n^6-n^5+n^4-n^3+n^2-n+1. |
|
+0
22
|
|
| 1, 1, 43, 547, 3277, 13021, 39991, 102943, 233017, 478297, 909091, 1623931, 2756293, 4482037, 7027567, 10678711, 15790321, 22796593, 32222107, 44693587, 60952381, 81867661, 108450343, 141867727, 183458857, 234750601, 297474451
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
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).
Number of walks of length 7 between any two distinct nodes of the complete graph K_{n+1} (n>=1). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 01 2004
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=0,...,1000
Index entries for sequences related to linear recurrences with constant coefficients
|
|
FORMULA
|
G.f.=(1-6x+57x^2+232x^3+351x^4+78x^5+7x^6)/(1-x)^7. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 01 2004
|
|
PROGRAM
|
(PARI) { for (n=0, 1000, write("b060888.txt", n, " ", n^6 - n^5 + n^4 - n^3 + n^2 - n + 1); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 14 2009]
|
|
CROSSREFS
|
Sequence in context: A093673 A140849 A008388 this_sequence A146979 A157722 A010959
Adjacent sequences: A060885 A060886 A060887 this_sequence A060889 A060890 A060891
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), May 05 2001
|
|
|
Search completed in 0.002 seconds
|
