|
| |
| |
|
|
|
1, 6, 55, 560, 5985, 65780, 736281, 8347680, 95548245, 1101716330, 12777711870, 148902215280, 1742058970275, 20448884000160, 240719591939480, 2840671544105280, 33594090947249085, 398039194165652550
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| a(n) is the number of paths avoiding $\uparrow ^{<E2><89><A5>2}$ from $(0,0)$ to \ $% (5n,n)$ and taking steps from \{$\uparrow ,\longrightarrow $\} [Nonascii characters need to be replace] - Shanzhen Gao (shanzhengao(AT)yahoo.com), Apr 15 2010
|
|
|
REFERENCES
| Shanzhen Gao, Pattern Avoidance in Paths and Walks, in preparation [From Shanzhen Gao (shanzhengao(AT)yahoo.com), Apr 15 2010]
|
|
|
FORMULA
| a(n) is asymptotic to c*sqrt(n)*(3125/256)^n with c=0.557....
|
|
|
MATHEMATICA
| Table[Binomial[5n+1, n], {n, 0, 20}] [From Harvey P. Dale, Jan. 23, 2011]
|
|
|
CROSSREFS
| Cf. A052203.
Sequence in context: A110431 A121661 A118836 * A006200 A151345 A095652
Adjacent sequences: A079586 A079587 A079588 * A079590 A079591 A079592
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 26 2003
|
| |
|
|
