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.

A210996 Number of free polyominoes with 2n cells.

Original entry on oeis.org

1, 1, 5, 35, 369, 4655, 63600, 901971, 13079255, 192622052, 2870671950, 43191857688, 654999700403, 9999088822075, 153511100594603, 2368347037571252, 36695016991712879, 570694242129491412, 8905339105809603405, 139377733711832678648, 2187263896664830239467, 34408176607279501779592
Offset: 0

Views

Author

Omar E. Pol, Sep 15 2012

Keywords

Comments

It appears that we can write A216492(n) < A216583(n) < A056785(n) < A056786(n) < a(n) < A210988(n) < A210986(n), if n >= 3. - Omar E. Pol, Sep 16 2012

Examples

			For n = 1 there is only one free domino. For n = 2 there are 5 free tetrominoes. For n = 3 there are 35 free hexominoes. For n = 4 there are 369 free octominoes (see link section).
		

Crossrefs

Programs

Formula

a(n) = A000105(2n).
a(n) = A213376(n) + A056785(n). - R. J. Mathar, Feb 08 2023

Extensions

More terms from John Mason, Apr 15 2023