A333458 Irregular table read by rows: Take a diagonal-edged (or diamond-shaped) checkerboard with all diagonals drawn, as in A333434. Then T(n,k) = number of k-sided polygons in that figure for k >= 3.
4, 84, 20, 692, 312, 72, 4, 2708, 2020, 400, 88, 0, 4, 7876, 5764, 1580, 264, 20, 4, 18220, 14868, 4960, 904, 112, 24, 36764, 30624, 11224, 2496, 304, 52, 66004, 55192, 18624, 3952, 472, 48, 111764, 97840, 40008, 9912, 1740, 244, 36, 175156, 158280, 63632, 15744, 2560, 156, 8, 16
Offset: 1
Examples
Table begins: 4; 84, 20; 692, 312, 72, 4; 2708, 2020, 400, 88, 0, 4; 7876, 5764, 1580, 264, 20, 4; 18220, 14868, 4960, 904, 112, 24; 36764, 30624, 11224, 2496, 304, 52; 66004, 55192, 18624, 3952, 472, 48; 111764, 97840, 40008, 9912, 1740, 244, 36; 175156, 158280, 63632, 15744, 2560, 156, 8, 16; ...
Links
- Lars Blomberg, Table of n, a(n) for n = 1..201 (the first 27 rows)
Crossrefs
Extensions
a(32) and beyond from Lars Blomberg, Jun 03 2020
Comments