Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005561
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005561 Number of walks on square lattice.
(Formerly M3596)
+0
3
1, 4, 24, 84, 392, 1344, 5760, 19800, 81675, 283140, 1145144, 4008004, 16032016, 56632576, 225059328, 801773856, 3173688180, 11392726800, 44986664800 (list; graph; listen)
OFFSET

3,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+4, ceil(n/2))*C(n+3, floor(n/2)) - C(n+4, ceil((n-1)/2))*C(n+3, floor((n-1)/2)). - Paul D. Hanna (pauldhanna(AT)juno.com), Apr 16 2004

PROGRAM

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

CROSSREFS

Cf. A005558-A005562, A093768.

Sequence in context: A112742 A158494 A069145 this_sequence A061612 A097875 A026694

Adjacent sequences: A005558 A005559 A005560 this_sequence A005562 A005563 A005564

KEYWORD

nonn,walk

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 19 01:26 EDT 2010. Contains 173632 sequences.


AT&T Labs Research