A348451 Triangle read by rows: T(n,k) (1 <= k <= n) is the number of 3-extensions of an n-set over all choices of 3-partitions of the n-set.

1, 2, 1, 5, 4, 1, 14, 13, 6, 1, 41, 40, 25, 9, 1, 122, 121, 90, 48, 12, 1, 365, 364, 301, 202, 78, 14, 1, 1094, 1093, 966, 747, 380, 106, 16, 1, 3281, 3280, 3025, 2559, 1571, 592, 141, 18, 1, 9842, 9841, 9330, 8362, 5864, 2755, 906, 180, 20, 1

Offset: 1

Author

N. J. A. Sloane, Oct 26 2021

Keywords

• nonn
• tabl

Comments

See Lindquist et al. 1981 for precise definition.

Examples

			Triangle begins:
1,
2,1,
5,4,1,
14,13,6,1,
41,40,25,9,1,
122,121,90,48,12,1,
365,364,301,202,78,14,1,
1094,1093,966,747,380,106,16,1,
3281,3280,3025,2559,1571,592,141,18,1,
9842,9841,9330,8362,5864,2755,906,180,20,1,
...
		

Links

• Norman Lindquist and Gerard Sierksma, Extensions of set partitions, Journal of Combinatorial Theory, Series A 31.2 (1981): 190-198. See Table III.

Crossrefs

Cf. A055248.

Column 1 = A007051, column 3 = A000392.