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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005571 Number of walks on cubic lattice.
(Formerly M5352)
0
76, 288, 700, 1376, 2380, 3776, 5628, 8000, 10956, 14560, 18876, 23968, 29900, 36736, 44540, 53376, 63308, 74400, 86716, 100320, 115276, 131648, 149500, 168896, 189900, 212576, 236988, 263200, 291276, 321280, 353276, 387328, 423500, 461856, 502460, 545376 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Table of n, a(n) for n=0..35.

R. K. Guy, Letter to N. J. A. Sloane, May 1990

R. K. Guy, Catwalks, sandsteps and Pascal pyramids, J. Integer Sequences, Vol. 3 (2000), Article #00.1.6 (see Figure 7).

Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992.

Simon Plouffe, 1031 Generating Functions and Conjectures, Université du Québec à Montréal, 1992.

Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1).

FORMULA

G.f.: 4*(19-4*z+z**2)/(z-1)^4. - Simon Plouffe in his 1992 dissertation

a(n) = 4(n+1)(n+3)(8n+19)/3.

PROG

(PARI) vector(40, n, n--; 4*(n+1)*(n+3)*(8*n+19)/3) \\ Michel Marcus, Oct 13 2014

CROSSREFS

Sequence in context: A251078 A153676 A060316 * A233877 A067987 A167586

Adjacent sequences:  A005568 A005569 A005570 * A005572 A005573 A005574

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified January 17 16:47 EST 2018. Contains 297822 sequences.