Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005562
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005562 Number of walks on square lattice.
(Formerly M3974)
+0
5
1, 5, 35, 140, 720, 2700, 12375, 45375, 196625, 715715, 3006003, 10930920, 45048640, 164105760, 668144880, 2441298600, 9859090500, 36149998500 (list; graph; listen)
OFFSET

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

PROGRAM

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

CROSSREFS

Cf. A005558-A005561, A093768.

Sequence in context: A096743 A026697 A000910 this_sequence A097872 A124793 A048515

Adjacent sequences: A005559 A005560 A005561 this_sequence A005563 A005564 A005565

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