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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005560 Number of walks on square lattice.
(Formerly M2987)
2
1, 3, 15, 45, 189, 588, 2352, 7560, 29700, 98010, 382239, 1288287, 5010005, 17177160, 66745536, 232092432, 901995588, 3173688180, 12342120700, 43861998180 (list; graph; refs; listen; history; internal format)
OFFSET

2,2

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

R. K. Guy, Catwalks, Sandsteps and Pascal Pyramids, J. Integer Seqs., Vol. 3 (2000), #00.1.6

FORMULA

a(n) = C(n+3, ceil(n/2))*C(n+2, floor(n/2)) - C(n+3, ceil((n-1)/2))*C(n+2, floor((n-1)/2)). - Paul D. Hanna (pauldhanna(AT)juno.com), Apr 16 2004

PROG

(PARI) {a(n)=binomial(n+3, ceil(n/2))*binomial(n+2, floor(n/2)) - binomial(n+3, ceil((n-1)/2))*binomial(n+2, floor((n-1)/2))}

CROSSREFS

Cf. A005558-A005562, A093768.

Sequence in context: A030505 A074355 A201868 * A100747 A100737 A178669

Adjacent sequences:  A005557 A005558 A005559 * A005561 A005562 A005563

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 15 16:49 EST 2012. Contains 205824 sequences.