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.

A118356 Number of clusters with n vertices, n-1 edges and zero contacts on the simple cubic lattice.

Original entry on oeis.org

1, 3, 15, 83, 486, 2967, 18748, 121725, 807381, 5447203, 37264974, 257896500, 1802312605, 12701190885, 90157130289, 644022007040, 4626159163233
Offset: 1

Views

Author

R. J. Mathar, May 14 2006

Keywords

Comments

a(n)<=A001931(n) due to the "no-contact" restriction.
An alternative wording for a(n) is the number of n-cell fixed tree-like polycubes in 3 dimensions. - Gill Barequet, May 25 2011

References

  • G. Aleksandrowicz and G. Barequet, Parallel enumeration of lattice animals, Proc. 5th Int. Frontiers of Algorithmics Workshop, Zhejiang, China, Lecture Notes in Computer Science, 6681, Springer-Verlag, 90-99, May 2011.

Crossrefs

Cf. A066158 (fixed tree-like polyominoes), A191094, A191095, A191096, A191097, A191098 (fixed tree-like polycubes in 4, 5, 6, 7, and 8 dimensions, resp.).

Extensions

a(1)=1 added by Gill Barequet, May 25 2011