|
Search: id:A091962
|
|
|
| A091962 |
|
From enumerating paths in the plane. |
|
+0
3
|
|
| 0, 1, 42, 594, 4719, 26026, 111384, 395352, 1215126, 3331251, 8321170, 19240650, 41683005, 85408596, 166768096, 312203232, 563178924, 982981701, 1665911754, 2749500754, 4430505387, 6985558206, 10797503640, 16388608600, 24462014850
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
G. Kreweras and H. Niederhausen, Solution of an enumerative problem connected with lattice paths, European J. Combin., 2 (1981), 55-60.
M. de Sainte Catherine, Couplages et Pfaffiens en Combinatoire, Physique et Informatique. Ph. D. Dissertation, Universite de Bordeaux 1, 1983.
R. P. Stanley, Enumerative Combinatorics, volume 1 (1986), p. 221, Example 4.5.18.
|
|
FORMULA
|
a(n) = binomial(2n+6, 7)*(2n+3)*(n+1)*(n+2)/240.
|
|
CROSSREFS
|
Cf. A006858.
Sequence in context: A088626 A086944 A104901 this_sequence A007746 A030197 A020933
Adjacent sequences: A091959 A091960 A091961 this_sequence A091963 A091964 A091965
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Mar 13 2004
|
|
|
Search completed in 0.002 seconds
|
