A210540
Number of arrays of n nonnegative integers with value i>0 appearing only after i-1 has appeared at least 3 times.
Original entry on oeis.org
1, 1, 1, 1, 2, 4, 8, 17, 40, 104, 291, 857, 2634, 8455, 28424, 100117, 368465, 1410903, 5599073, 22968514, 97267342, 424927846, 1913764155, 8877181958, 42358589064, 207639979365, 1044360973987, 5384167878948, 28429186870051, 153638182314504, 849295001319211
Offset: 0
Some solutions for n=11
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..1....1....0....1....1....1....0....1....1....1....1....1....1....1....1....0
..0....1....1....0....1....1....1....0....1....0....0....0....1....1....0....0
..1....1....0....1....0....1....1....0....1....1....0....1....1....1....1....1
..1....0....1....1....1....0....1....0....2....1....0....1....2....2....0....0
..2....2....0....2....2....2....0....0....0....1....1....0....1....2....0....0
..2....0....0....2....2....2....0....1....1....0....1....1....2....2....0....1
..2....1....0....1....0....1....2....0....1....0....2....0....2....2....1....1
..3....1....1....0....2....2....0....1....0....2....1....0....2....0....2....1
- Alois P. Heinz, Table of n, a(n) for n = 0..700 (terms n = 1..210 from R. H. Hardin)
- Rigoberto Flórez, José L. Ramírez, Fabio A. Velandia, and Diego Villamizar, Some Connections Between Restricted Dyck Paths, Polyominoes, and Non-Crossing Partitions, arXiv:2308.02059 [math.CO], 2023. See Table 1 p. 13.
A210541
Number of arrays of n nonnegative integers with value i>0 appearing only after i-1 has appeared at least 4 times.
Original entry on oeis.org
1, 1, 1, 1, 2, 4, 8, 16, 33, 73, 177, 467, 1309, 3813, 11409, 34999, 110510, 361194, 1226930, 4334048, 15877297, 60049447, 233426007, 929616461, 3786970033, 15777120457, 67260334185, 293617319221, 1312868943154, 6010792180952
Offset: 1
Some solutions for n=13
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..1....1....1....0....1....1....1....0....1....1....0....0....1....0....0....1
..1....1....1....1....1....0....1....0....1....1....1....1....0....1....1....1
..0....1....0....0....1....0....1....0....0....0....0....1....0....0....1....0
..0....1....1....1....1....1....0....1....1....1....1....0....1....1....1....1
..1....2....1....0....0....1....1....1....1....1....0....0....1....1....1....0
..1....0....2....1....2....1....0....0....2....0....0....0....0....1....0....0
..0....1....1....1....2....2....1....1....1....0....0....1....0....2....2....1
..1....0....2....0....1....2....1....1....0....1....0....1....1....0....1....1
..2....0....1....2....1....0....2....2....2....0....0....1....2....0....2....0
- R. H. Hardin, Table of n, a(n) for n = 1..210
- Rigoberto Flórez, José L. Ramírez, Fabio A. Velandia, and Diego Villamizar, Some Connections Between Restricted Dyck Paths, Polyominoes, and Non-Crossing Partitions, arXiv:2308.02059 [math.CO], 2023. See Table 1 p. 13.
A210542
Number of arrays of n nonnegative integers with value i>0 appearing only after i-1 has appeared at least 5 times.
Original entry on oeis.org
1, 1, 1, 1, 1, 2, 4, 8, 16, 32, 65, 138, 315, 782, 2090, 5885, 17112, 50743, 152705, 466760, 1455562, 4658963, 15392116, 52663709, 186632887, 683133153, 2570929570, 9900731604, 38864321047, 155126476313, 629028834312, 2592051975917
Offset: 1
Some solutions for n=15:
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....1....0....0....1....1....0....1....0....1....1....1....0....1....1....1
..0....0....0....0....0....0....1....1....1....0....1....0....0....1....1....0
..1....1....0....1....1....1....1....1....0....1....1....1....1....1....1....0
..0....0....1....0....1....0....1....0....0....1....0....0....1....1....1....1
..1....0....1....1....0....1....1....1....1....1....0....0....0....1....1....0
..0....0....1....1....0....1....1....1....1....1....0....0....1....1....1....1
..0....1....0....0....1....1....1....2....1....0....1....0....1....2....0....1
..0....0....0....0....0....2....1....0....1....1....1....1....1....2....1....0
..0....1....1....1....0....2....1....1....0....0....0....1....1....0....0....0
..0....0....1....1....0....0....1....0....1....1....0....0....2....2....0....1
- R. H. Hardin, Table of n, a(n) for n = 1..210
- Rigoberto Flórez, José L. Ramírez, Fabio A. Velandia, and Diego Villamizar, Some Connections Between Restricted Dyck Paths, Polyominoes, and Non-Crossing Partitions, arXiv:2308.02059 [math.CO], 2023. See Table 1 p. 13.
A210543
Number of arrays of n nonnegative integers with value i>0 appearing only after i-1 has appeared at least 6 times.
Original entry on oeis.org
1, 1, 1, 1, 1, 1, 2, 4, 8, 16, 32, 64, 129, 267, 582, 1364, 3454, 9338, 26429, 76929, 227579, 680113, 2050000, 6242818, 19284165, 60754153, 196341570, 654012814, 2251195713, 8005274899, 29325473071, 110181281435, 422565983725
Offset: 1
Some solutions for n=17
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....1....1....1....0....0....1....1....1....0....1....1....1....1....0....0
..1....0....0....1....0....1....1....1....1....1....0....1....0....1....1....1
..0....0....0....1....1....1....1....0....1....1....1....0....1....1....1....1
..1....1....1....0....0....1....0....1....1....1....1....0....1....0....1....1
..0....0....1....1....0....1....1....1....0....0....0....0....0....1....1....1
..1....1....1....1....1....1....1....1....1....1....1....1....1....1....1....0
..0....1....0....0....1....0....0....1....1....1....1....1....1....1....1....0
..1....1....0....1....0....1....0....1....2....1....1....1....1....0....0....1
..1....0....0....1....1....0....1....0....2....1....0....0....0....0....1....1
..1....0....1....1....0....0....2....1....0....1....0....0....0....0....1....1
..2....0....1....0....1....0....1....1....2....0....0....1....2....1....2....0
A210544
Number of arrays of n nonnegative integers with value i>0 appearing only after i-1 has appeared at least 7 times.
Original entry on oeis.org
1, 1, 1, 1, 1, 1, 1, 2, 4, 8, 16, 32, 64, 128, 257, 524, 1106, 2470, 5924, 15262, 41690, 118595, 345861, 1023028, 3050590, 9146312, 27567958, 83678750, 256632743, 798853376, 2537255097, 8264988956, 27723246374, 95941707086, 342355797248
Offset: 1
Some solutions for n=19
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....1....1....0....1....1....0....1....1....1....1....0....1....0....0....0
..1....1....0....0....0....1....1....0....0....1....1....1....0....1....1....1
..1....0....1....1....1....0....1....0....0....1....0....0....0....1....0....1
..0....1....0....0....0....1....1....0....1....1....1....1....0....1....1....1
..0....0....1....0....1....0....1....0....1....0....1....0....0....1....1....0
..1....0....0....1....1....1....0....0....0....1....1....0....1....1....1....0
..0....1....1....0....1....1....0....0....0....1....1....1....0....1....1....0
..0....1....1....0....1....1....0....0....1....0....1....0....0....1....1....1
..1....1....1....1....0....1....0....0....1....1....2....1....1....0....1....0
..1....1....1....1....0....2....0....0....0....1....1....1....1....0....2....1
..0....0....1....1....1....1....0....0....1....0....1....1....0....1....2....1
..0....1....1....1....0....2....1....1....1....0....0....0....1....1....2....1
Showing 1-5 of 5 results.
Comments