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.

A218869 Triangle read by rows: T(n,k) = number of aperiodic binary sequences of length n with curling number k (1 <= k <= n).

Original entry on oeis.org

2, 2, 0, 4, 2, 0, 6, 4, 2, 0, 12, 12, 4, 2, 0, 20, 20, 8, 4, 2, 0, 40, 52, 20, 8, 4, 2, 0, 74, 100, 36, 16, 8, 4, 2, 0, 148, 214, 76, 36, 16, 8, 4, 2, 0, 286, 414, 160, 68, 32, 16, 8, 4, 2, 0, 572, 876, 328, 140, 68, 32, 16, 8, 4, 2, 0, 1124, 1722, 640, 276, 132, 64, 32, 16, 8, 4, 2, 0
Offset: 1

Views

Author

N. J. A. Sloane, Nov 07 2012

Keywords

Comments

S is aperiodic if it is not of the form S = T^m with m > 1.
Row sums are A027375. First column is A122536.
It appears that reversed rows converge to A155559. - Omar E. Pol, Nov 20 2012

Examples

			Triangle begins:
2,
2, 0,
4, 2, 0,
6, 4, 2, 0,
12, 12, 4, 2, 0,
20, 20, 8, 4, 2, 0,
40, 52, 20, 8, 4, 2, 0,
74, 100, 36, 16, 8, 4, 2, 0,
148, 214, 76, 36, 16, 8, 4, 2, 0,
286, 414, 160, 68, 32, 16, 8, 4, 2, 0,
572, 876, 328, 140, 68, 32, 16, 8, 4, 2, 0,
...
		

Crossrefs