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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A071803 Number of paths in the lattice [0..n] X [0..n] X [0..n] which do not pass through the point (Floor(n/2),Floor(n/2),Floor(n/2)). Number of paths through a lattice containing a "hole". 2
54, 1140, 26550, 605556, 14330736, 340860960, 8264889270, 201651836100, 4978317147804, 123546256876224, 3090501687886704, 77632745316063840, 1961313438507566400, 49717549985405892480, 1265749551338006549430 (list; graph; refs; listen; history; internal format)
OFFSET

2,1

LINKS

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

FORMULA

s(3, n) - s(3, Floor(n/2)) s(3, Ceiling(n/2))

MATHEMATICA

Table[Factorial[3n]/Factorial[n]^3 - Factorial[3Floor[n/2]]Factorial[3Ceiling[n/2]]/Factorial[Floor[n/2]]^3/Factorial[Ceiling[n/2]]^3, {n, 2, 20}]

CROSSREFS

Cf. A006480, A071800, A071801.

Sequence in context: A160345 A121625 A190399 * A160289 A079876 A017770

Adjacent sequences:  A071800 A071801 A071802 * A071804 A071805 A071806

KEYWORD

easy,nice,nonn

AUTHOR

T. D. Noe (noe(AT)sspectra.com), Jun 06 2002

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 21:56 EST 2012. Contains 205860 sequences.