|
| |
|
|
A160175
|
|
Expansion of 1/(1-2x-2x^2-2x^3-2x^4)
|
|
0
| |
|
|
1, 2, 6, 18, 54, 160, 476, 1416, 4212, 12528, 37264, 110840, 329688, 980640, 2916864, 8676064, 25806512, 76760160, 228319200, 679123872, 2020019488
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| a(n) is the number of ways two opposing baseball teams could score a combined total of n runs (tallying the score just prior to each "batter up!") considering the order of the scoring as important. Equivalently, a(n) is the number of 2-colored tilings of an n-board with tiles of length at most 4.
|
|
|
REFERENCES
| Arthur Benjamin and Jennifer Quinn, Proofs that Really Count, Mathematical Association of America,2003,p.36
|
|
|
FORMULA
| a(n)=2(a(n-1)+a(n-2)+a(n-3)+a(n-4))
|
|
|
MATHEMATICA
| RecurrenceTable[{a[n] == 2(a[n - 1] + a[n - 2] + a[n - 3] + a[n - 4]), a[0] == 1, a[1] == 2, a[2] == 6, a[3] == 18}, a, {n, 0, 20}]
|
|
|
CROSSREFS
| Cf. A077835, A002605, A000079
Sequence in context: A132790 A072850 A182899 * A072852 A072853 A179344
Adjacent sequences: A160172 A160173 A160174 * A160176 A160177 A160178
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Geoffrey Critzer (critzer.geoffrey(AT)usd443.org), May 03 2009, May 06 2009
|
| |
|
|
