cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

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

Original entry on oeis.org

0, 8, 900, 359424, 370828800, 820150272000, 3435918974208000, 24957654229057536000, 294060698786444083200000, 5334667831784096818790400000, 42889554205720574193041408000000
Offset: 1

Views

Author

Peter J. Cameron, Sep 14 2005

Keywords

Examples

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

References

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

Crossrefs

Cf. A010796 (2-D case), A112579, A112580.

Formula

a(1)=0, a(n) = (n!)^2*b(n)/2^n for n>1, where b(0)=1 and sum (n-1 choose k-1)*((2n-2k-1)!!)^2*b(k) = ((2n-1)!!)^2.

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

Original entry on oeis.org

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

Views

Author

Peter J. Cameron, Sep 14 2005

Keywords

Examples

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

References

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

Crossrefs

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

Formula

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