A359619 Irregular table read by rows: T(n,k) is the number of k-gons, k>=1, after n iterations of constructing circles from all current vertices using only a compass, starting with one vertex. See the Comments.

0, 1, 0, 0, 2, 1, 0, 1, 16, 4, 0, 16, 2470, 3599, 902, 168, 14

Offset

1,5

Comments

See A359569 and A359570 for further details and images.

Links

Table of n, a(n) for n=1..17.

Formula

Sum of row n = A359570(n);

Example

The table begins:
0;
1;
0, 0, 2, 1;
0, 1, 16, 4;
0, 16, 2470, 3599, 902, 168, 14;
.
.

Crossrefs

Cf. A359569 (vertices), A359570 (regions), A359571 (edges), A359258, A359061, A359009.

Sequence in context: A331278 A266632 A062154 * A334159 A326474 A266886

Adjacent sequences: A359616 A359617 A359618 * A359620 A359621 A359622

Keyword

nonn,more,hard,tabf

Author

Scott R. Shannon, Jan 07 2023

Status

approved