%I #25 Dec 12 2018 14:24:26

%S 1,1,2,1,2,3,1,2,3,4,1,2,4,5,6,1,2,4,6,7,8,1,2,4,7,9,10,11,1,2,4,7,10,

%T 12,13,14,1,2,4,8,12,15,17,18,19,1,2,4,8,13,17,20,22,23,24,1,2,4,8,14,

%U 20,24,27,29,30,31,1,2,4,8,15,22,28,32,35,37,38,39,1,2,4,8,15,24,32,38,42,45,47

%N Triangular array read by rows, where T(n,k) is the number of almost distinct partitions of n in which every part is <= k for 1 <= k <= n.

%C An almost distinct partition of n with parts bounded by k is a decreasing sequence of positive integers (a(1), a(2), ..., a(k)) such that n = a(1) + a(2) +...+ a(k), any a(i) > 1 is distinct from all other values, and all a(i) <= k.

%H Michael De Vlieger, <a href="/A318806/b318806.txt">Table of n, a(n) for n = 1..3240</a> (rows 1 <= n <= 80, flattened).

%H Sara Billey, Matjaž Konvalinka, and Joshua P. Swanson, <a href="http://arxiv.org/abs/1809.07386">Tableaux posets and the fake degrees of coinvariant algebras</a>, arXiv:1809.07386 [math.CO], 2018.

%e There are T(5,6) = 7 almost distinct partitions of 6 in which every part is <= 5: [5,1], [4,2], [4,1,1], [3,2,1], [3,1,1,1], [2,1,1,1,1], [1,1,1,1,1,1].

%e Triangle starts:

%e 1;

%e 1, 2;

%e 1, 2, 3;

%e 1, 2, 3, 4;

%e 1, 2, 4, 5, 6;

%e 1, 2, 4, 6, 7, 8;

%e 1, 2, 4, 7, 9, 10, 11;

%e 1, 2, 4, 7, 10, 12, 13, 14;

%e 1, 2, 4, 8, 12, 15, 17, 18, 19;

%e 1, 2, 4, 8, 13, 17, 20, 22, 23, 24;

%e ...

%t Array[Table[Count[#, _?(# <= k &)], {k, Max@ #}] &@ DeleteCases[Map[Boole[Flatten@ MapAt[Union, TakeDrop[#, LengthWhile[#, # == 1 &]], -1] == # &@ Reverse@ #] Max@ # &, Reverse@ IntegerPartitions[#]], 0] &, 13] // Flatten (* _Michael De Vlieger_, Dec 12 2018 *)

%Y Cf. A000009, A026820, A008302.

%K nonn,tabl

%O 1,3

%A _Sara Billey_, Sep 04 2018