|
Search: id:A005569
|
|
|
| A005569 |
|
Number of walks on square lattice.
(Formerly M3654)
|
|
+0
1
|
|
| 4, 34, 308, 3024, 31680, 349206, 4008004, 47530912, 579058896, 7215393640, 91644262864, 1183274479040, 15497363512800, 205519758825150, 2755739674246500, 37314861293793600, 509727100259638800
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
R. K. Guy, Catwalks, Sandsteps and Pascal Pyramids, J. Integer Seqs., Vol. 3 (2000), #00.1.6
|
|
FORMULA
|
G.f.: 4_F_3 ( [ 2, 17/5, 5/2, 3/2 ]; [ 4, 5, 12/5 ];16 x ).
a(n)(n-1)(n+2)(n+3)(5n+2)=a(n-1)4n(2n-1)(2n+1)(5n+7), n>1. - Michael Somos, Mar 04 2003
|
|
PROGRAM
|
(PARI) a(n)=4*if(n<2, n==1, a(n-1)*n*(2*n-1)*(2*n+1)*(5*n+7)/((n-1)*(n+2)*(n+3)*(5*n+2)))
|
|
CROSSREFS
|
Adjacent sequences: A005566 A005567 A005568 this_sequence A005570 A005571 A005572
Sequence in context: A049293 A116430 A036352 this_sequence A025572 A093137 A107350
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
