login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A071969 Sum( binomial(n+1,k)*binomial(2*n-3*k,n-3*k)/(n+1),k=0..floor(n/3)). 5
1, 1, 2, 6, 19, 63, 219, 787, 2897, 10869, 41414, 159822, 623391, 2453727, 9733866, 38877318, 156206233, 630947421, 2560537092, 10435207116, 42689715279, 175243923783, 721649457417, 2980276087005, 12340456995177, 51222441676513, 213090270498764, 888321276659112 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

Diagonal of A071946. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 15 2004

REFERENCES

D. Merlini et al., Underdiagonal lattice paths with unrestricted steps, Discrete Appl. Math., 91 (1999), 197-213 (d_n page 209).

LINKS

D. Merlini et al., Underdiagonal lattice paths with unrestricted steps, Discrete Appl. Math., 91 (1999), 197-213 (d_n page 209).

FORMULA

G.f. (offset 1) is series reversion of (x-x^2)/(1+x^3).

MAPLE

A071969 := n->add( binomial(n+1, k)*binomial(2*n-3*k, n-3*k)/(n+1), k=0..floor(n/3));

Order:=30: g:=solve(series((H-H^2)/(1+H^3), H)=z, H): seq(coeff(g, z^n), n=1..28); (Deutsch)

PROG

(PARI) a(n)=if(n<0, 0, polcoeff(serreverse((x-x^2)/(1+x^3)+x^2*O(x^n)), n+1))

CROSSREFS

Cf. A071946.

Sequence in context: A001168 A193111 A119255 * A063030 A206463 A148467

Adjacent sequences:  A071966 A071967 A071968 * A071970 A071971 A071972

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jun 17 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 01:35 EST 2012. Contains 205567 sequences.