Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005559
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005559 Number of walks on square lattice.
(Formerly M1832)
+0
3
1, 2, 8, 20, 75, 210, 784, 2352, 8820, 27720, 104544, 339768, 1288287, 4294290, 16359200, 55621280, 212751396, 734959368, 2821056160, 9873696560, 38013731756 (list; graph; listen)
OFFSET

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

PROGRAM

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

CROSSREFS

Cf. A005558-A005560, A093768.

Sequence in context: A100097 A133467 A091004 this_sequence A001471 A162585 A000159

Adjacent sequences: A005556 A005557 A005558 this_sequence A005560 A005561 A005562

KEYWORD

nonn

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 | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research