Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005558
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005558 Number of walks on square lattice.
(Formerly M2598)
+0
7
1, 1, 3, 6, 20, 50, 175, 490, 1764, 5292, 19404, 60984, 226512, 736164, 2760615, 9202050, 34763300, 118195220, 449141836, 1551580888, 5924217936, 20734762776 (list; graph; listen)
OFFSET

0,3

REFERENCES

Heinrich Niederhausen, A Note on the Enumeration of Diffusion Walks in the First Octant by Their Number of Contacts with the Diagonal, Journal of Integer Sequences, Vol. 8 (2005), Article 05.4.3.

LINKS

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

FORMULA

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

PROGRAM

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

CROSSREFS

See A138350 for a signed version.

Bisections are A000891 and A000888/2.

Cf. A005559-A005562, A093768.

Adjacent sequences: A005555 A005556 A005557 this_sequence A005559 A005560 A005561

Sequence in context: A081181 A062164 A052408 this_sequence A138350 A090371 A123559

KEYWORD

nonn

AUTHOR

njas

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 October 13 02:37 EDT 2008. Contains 145008 sequences.


AT&T Labs Research