|
| |
| |
|
|
|
1, 7, 78, 969, 12650, 169911, 2324784, 32224114, 450978066, 6358402050, 90177170226, 1285063345176, 18385569737808, 263926640438545, 3799541229226200, 54834293825867556, 793067310934426018
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| a(n) is he number of paths avoiding $\uparrow ^{=2}$ from $(0,0)$ to \ $% (6n,n)$ and taking steps from \{$\uparrow ,\longrightarrow $\}. [From 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)*(46656/3125)^n with c= 0.5243....
|
|
|
CROSSREFS
| Cf. A052203.
Sequence in context: A068621 A133272 A186657 * A202755 A156714 A106110
Adjacent sequences: A079587 A079588 A079589 * A079591 A079592 A079593
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 26 2003
|
| |
|
|
