login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A187171 Number of 10-step self-avoiding walks on a nXnXn cube summed over all starting positions 2
0, 0, 414912, 6654048, 30938640, 85654320, 181790352, 330218544, 541990896, 828222216, 1200035436, 1668553872, 2244900840, 2940199656, 3765573636, 4732146096, 5851040352, 7133379720, 8590287516, 10232887056, 12072301656 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Row 10 of A187162

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..50

FORMULA

Empirical: a(n) = 1853886*n^3 - 12825630*n^2 + 27515184*n - 18252624 for n>8

CROSSREFS

Sequence in context: A251828 A256732 A078519 * A178203 A152869 A251960

Adjacent sequences:  A187168 A187169 A187170 * A187172 A187173 A187174

KEYWORD

nonn

AUTHOR

R. H. Hardin Mar 06 2011

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 20 08:07 EST 2020. Contains 331081 sequences. (Running on oeis4.)