|
Search: id:A025250
|
|
|
| A025250 |
|
a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-3)*a(3) for n >= 4. |
|
+0
5
|
|
| 0, 1, 1, 0, 1, 1, 1, 3, 3, 6, 11, 15, 31, 50, 85, 161, 267, 490, 883, 1548, 2863, 5127, 9307, 17116, 31021, 57123, 104963, 192699, 356643, 658034, 1218517, 2262079, 4196895, 7812028, 14549655, 27126118, 50671255, 94697293, 177220411, 332015747
(list; graph; listen)
|
|
|
OFFSET
|
1,8
|
|
|
COMMENT
|
Number of lattice paths from (0,0) to (n-3,0) that stay weakly in the first quadrant and such that each step is either U=(1,1),D=(2,-1), or H=(2,0). E.g. a(10)=6 because we have HHUD, HUDH, HUHD, UDHH, UHDH and UHHD. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 23 2003
Hankel transform of a(n+2) is Somos-4 variant A050512. [From Paul Barry (pbarry(AT)wit.ie), Jul 05 2009]
|
|
FORMULA
|
G.f.: (1+x^2-sqrt(1-2*x^2-4*x^3+x^4))/2 - Michael Somos, Jun 08, 2000.
G.f.: x^2+x^3*(1/(1-x^2))c(x^3/(1-x^2)^2) where c(x) is the g.f. of A000108. [From Paul Barry (pbarry(AT)wit.ie), May 20 2009]
a(n+2)=sum{k=0..n, C((n+k)/2,2k)(1+(-1)^(n-k))*A000108(k)/2}. [From Paul Barry (pbarry(AT)wit.ie), Jul 06 2009]
|
|
PROGRAM
|
(PARI) a(n)=polcoeff((x^2-sqrt(1-2*x^2-4*x^3+x^4+x*O(x^n)))/2, n)
|
|
CROSSREFS
|
Sequence in context: A049924 A049926 A110952 this_sequence A094305 A057963 A112434
Adjacent sequences: A025247 A025248 A025249 this_sequence A025251 A025252 A025253
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
Search completed in 0.002 seconds
|
