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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A229955 Triangular array read by rows: 3 dimensional analog of A227997. 0

%I #17 Oct 09 2013 03:12:35

%S 8,152,64,5056,2432,512,205720,104000,29184,4096,9305152,4828544,

%T 1525248,311296,32768,449404224,236984448,79898624,19226624,3112960,

%U 262144,22695553536,12099474432,4251479040,1123909632,221839360,29884416,2097152,1183891745688,636162156096,230017430016,64636047360,14330265600,2413559808,278921216,16777216

%N Triangular array read by rows: 3 dimensional analog of A227997.

%C T(n,k) is the number of walks on the 3 dimensional grid that start and end at the origin using 2n steps and having exactly k primitive loops. The steps are in the eight directions: (1,1,1), (1,1,-1), (1,-1,1), (1,-1,-1), (-1,1,1), (-1,1,-1), (-1,-1,1), (-1,-1,-1). A primitive loop is a walk that starts and ends on the origin but does not otherwise touch the origin.

%C Column 1 is A094059.

%C Row sums are A002897.

%F G.f.: 1/( 1 - y*(1 - 1/A(x)) ) where A(x) is the o.g.f. for A002897.

%F Generally for such walks in N dimensions: 1/( 1 - y*(1 - 1/B(x)) ) where B(x) = Sum_{n>=0} binomial(2n,n)^N*x^n.

%e 8,

%e 152, 64,

%e 5056, 2432, 512,

%e 205720, 104000, 29184, 4096,

%e 9305152, 4828544, 1525248, 311296, 32768,

%e 449404224, 236984448, 79898624, 19226624, 3112960, 262144

%t nn=6;a=Sum[Binomial[2n,n]^3x^n,{n,0,nn}];Map[Select[#,#>0&]&,Drop[CoefficientList[Series[1/(1-y(1-1/a)),{x,0,nn}],{x,y}],1]]//Grid

%K nonn,tabl,walk

%O 1,1

%A _Geoffrey Critzer_, Oct 04 2013

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 02:23 EDT 2024. Contains 371264 sequences. (Running on oeis4.)