|
Search: id:A000803
|
|
|
| A000803 |
|
a(n+3)=a(n+2)+a(n+1)+a(n)-4.
(Formerly M4472 N2232)
|
|
+0
3
|
|
| 0, 0, 8, 4, 8, 16, 24, 44, 80, 144, 264, 484, 888, 1632, 3000, 5516, 10144, 18656, 34312, 63108, 116072, 213488, 392664, 722220, 1328368, 2443248, 4493832, 8265444, 15202520, 27961792, 51429752, 94594060, 173985600, 320009408
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
This sequence and A004306 coincide from the term "24" onwards. This follows easily by studying the two g.f.'s. - R. J. Mathar and A. Plewe, Dec 04 2007
|
|
REFERENCES
|
H. Beker and C. Mitchell, Permutations with restricted displacement, SIAM J. Algebraic Discr. Methods, 8 (1987), 338-363.
N. Metropolis et al., Permanents of cyclic (0,1) matrices, J. Combin. Theory, 7 (1969), 291-321.
H. Minc, Permanents of (0,1)-circulants, Canad. Math. Bull., 7 (1964), 253-263.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..400
|
|
FORMULA
|
G.f. = -x^2*(3x-2) /(x-1)/(x^3+x^2+x-1) = 2(-5x^2+1)/(x^3+x^2+x-1)-2/(x-1) . - R. J. Mathar, Dec 04 2007
|
|
CROSSREFS
|
Cf. A000804, A000805, A004306.
Sequence in context: A110835 A087015 A124012 this_sequence A093208 A011225 A011196
Adjacent sequences: A000800 A000801 A000802 this_sequence A000804 A000805 A000806
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), Mar 17 2000
|
|
|
Search completed in 0.002 seconds
|
