Search: id:A060884
Results 1-1 of 1 results found.
%I A060884
%S A060884 1,1,11,61,205,521,1111,2101,3641,5905,9091,13421,19141,26521,35855,
%T A060884 47461,61681,78881,99451,123805,152381,185641,224071,268181,318505,
%U A060884 375601,440051,512461,593461,683705,783871,894661,1016801,1151041
%N A060884 n^4-n^3+n^2-n+1.
%C A060884 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).
%C A060884 Number of walks of length 5 between any two distinct nodes of the complete
graph K_{n+1} (n>=1). Example: a(1)=1 because in the complete graph
AB we have only one walk of length 5 between A and B: ABABAB. - Emeric
Deutsch (deutsch(AT)duke.poly.edu), Apr 01 2004
%H A060884 Harry J. Smith, Table of n, a(n) for n=0,...,1000
a>
%H A060884 Index entries for sequences related to
linear recurrences with constant coefficients
%F A060884 G.f.=(1-4x+16x^2+6x^3+5x^4)/(1-x)^5. - Emeric Deutsch (deutsch(AT)duke.poly.edu),
Apr 01 2004
%o A060884 (PARI) { for (n=0, 1000, write("b060884.txt", n, " ", n^4 - n^3 + n^2
- n + 1); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul
13 2009]
%Y A060884 Sequence in context: A066597 A078554 A002650 this_sequence A141935 A001847
A089764
%Y A060884 Adjacent sequences: A060881 A060882 A060883 this_sequence A060885 A060886
A060887
%K A060884 nonn
%O A060884 0,3
%A A060884 N. J. A. Sloane (njas(AT)research.att.com), May 05 2001
Search completed in 0.001 seconds