A112578 -id:A112578 - cp's OEIS frontend

A112579 Number of 3-D arrays of 0's and 1's with plane sums 2.

0, 8, 900, 366336, 378028800, 833156928000, 3477528928742400, 25183876050321408000, 296058177312000019660800, 5362158372805111867637760000, 143458227395428379364635443200000

Offset: 1

Peter J. Cameron, Sep 14 2005

			a(2)=8: six pairs of opposite edges and two inscribed tetrahedra.

P. J. Cameron and T. W. Mueller, Decomposable functors and the exponential principle, II, in preparation

P. J. Cameron and T. W. Mueller, Decomposable functors and the exponential principle, II, arXiv:0911.3760 [math.CO]

Cf. A001499 (2-D case), A112578, A112580.

a(n) = b(n) + Sum (k/n)*(n choose k)^3*b(k)*a(n-k), where b(n) counts indecomposable arrays (A112578).

A112580 Number of 3-D arrays of nonnegative integers with plane sums 2.

Original entry on oeis.org

1, 12, 1152, 431424, 427723200, 920031955200, 3777894212198400, 27039993414897254400, 315084437077115278540800, 5667616936309704095784960000, 150796432741520745587273564160000

Offset: 1

Peter J. Cameron, Sep 14 2005

			a(2)=12: eight 0-1 arrays and four with 2s at opposite vertices.

P. J. Cameron and T. W. Mueller, Decomposable functors and the exponential principle, II, in preparation

P. J. Cameron and T. W. Mueller, Decomposable functors and the exponential principle, II, arXiv:0911.3760 [math.CO]

Cf. A001499 (2-D case), A112578, A112579.

a(n) = b(n) + Sum (k/n)*(n choose k)^3*b(k)*a(n-k), where b(n) counts indecomposable arrays (A112578 with first term 1).

cp's OEIS Frontend

A112579 Number of 3-D arrays of 0's and 1's with plane sums 2.

Views

Author

Keywords

Examples

References

Links

Crossrefs

Formula