cp's OEIS Frontend

A368565 a(n) = number of pairs (p,q) of partitions of n such that d(p,q) < o(p,q), where d and o are distance functions; see Comments.

%I A368565 #6 Jan 20 2024 09:46:49
%S A368565 0,0,0,0,0,30,106,316,652,1388,2618,5170,9164,16790,29046,50714,84732,
%T A368565 143588,234048,385210,617050,990868,1558310,2459300,3806838,5900184
%N A368565 a(n) = number of pairs (p,q) of partitions of n such that d(p,q) < o(p,q), where d and o are distance functions; see Comments.
%C A368565 The definition of d depends on the greedy ordering of the partitions p(i) of n; that is, p(1) >= p(2) >= ... >= p(k), where k = A000041(n); see A366156. The ordinal distance o is defined by o(p(i),p(j)) = |i-j|.
%F A368565 A368564(n) + a(n) + A368566(n) = A001255(n) for n >= 1.
%e A368565 The 5 partitions of 4 are (p(1),p(2),p(3),p(4),p(5)) = (4,21,22,211,1111). The following table shows the 25 pairs d(p(i),q(j)) and o(p(i),q(j)):
%e A368565           |    4   31   22   211  1111
%e A368565 ------------------------------------------------
%e A368565    4 d    |    0    2    4    4    6
%e A368565      o    |    0    1    2    3    4
%e A368565   31 d    |    2    0    2    2    4
%e A368565      o    |    1    0    1    2    3
%e A368565   22 d    |    4    2    0    2    4
%e A368565      o    |    2    1    0    1    2
%e A368565  211 d    |    4    2    2    0    2
%e A368565      o    |    3    2    1    0    1
%e A368565 1111 d    |    6    4    4    2    0
%e A368565      o    |    4    3    2    1    0
%e A368565 The table shows 0 pairs (p,q) for which d(p,q) < o(p,q), so a(4) = 0.
%t A368565 c[n_] := PartitionsP[n];
%t A368565 q[n_, k_] := q[n, k] = IntegerPartitions[n][[k]];
%t A368565 r[n_, k_] := r[n, k] = Join[q[n, k], ConstantArray[0, n - Length[q[n, k]]]];
%t A368565 d[u_, v_] := Total[Abs[u - v]];
%t A368565 p[n_] := Flatten[Table[d[r[n, j], r[n, k]] - Abs[j - k], {j, 1, c[n]}, {k, 1, c[n]}]];
%t A368565 Table[Count[p[n], 0], {n, 1, 16}]  (* A368565  *)
%t A368565 Table[Length[Select[p[n], Sign[#] == -1 &]], {n, 1,16}]  (* A368566 *)
%t A368565 Table[Length[Select[p[n], Sign[#] == 1 &]], {n, 1, 16}]  (* A368567 *)
%Y A368565 Cf. A000041, A001255, A366156, A368564, A368566.
%K A368565 nonn,more
%O A368565 1,6
%A A368565 _Clark Kimberling_, Dec 31 2023