The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A187171 Number of 10-step self-avoiding walks on an n X n X n cube summed over all starting positions. 2

%I #10 Apr 18 2022 22:42:15

%S 0,0,414912,6654048,30938640,85654320,181790352,330218544,541990896,

%T 828222216,1200035436,1668553872,2244900840,2940199656,3765573636,

%U 4732146096,5851040352,7133379720,8590287516,10232887056,12072301656

%N Number of 10-step self-avoiding walks on an n X n X n cube summed over all starting positions.

%H R. H. Hardin, <a href="/A187171/b187171.txt">Table of n, a(n) for n = 1..50</a>

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

%Y Row 10 of A187162.

%K nonn

%O 1,3

%A _R. H. Hardin_, Mar 06 2011

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

Last modified December 3 21:20 EST 2023. Contains 367540 sequences. (Running on oeis4.)