cp's OEIS Frontend

A378623 Number of pairs (u,v) for which there is a set of n positive integers X = {x_1, ..., x_n} with u = |X+X| = #{x_i + x_j : 1 <= i,j <=n} and v = |X*X| = #{x_i * x_j : 1 <= i,j <=n}.

%I A378623 #31 Mar 12 2025 08:21:16
%S A378623 1,1,3,10,27,69
%N A378623 Number of pairs (u,v) for which there is a set of n positive integers X = {x_1, ..., x_n} with u = |X+X| = #{x_i + x_j : 1 <= i,j <=n} and v = |X*X| = #{x_i * x_j : 1 <= i,j <=n}.
%C A378623 As 2n-1 <= |X+X|,|X*X| <= n(n+1)/2 by combinatorics, we know that a(n) <= 1/4 (n^2-3n+4)^2 <= 0.25 n^4 - 1.5 n^3 + O(n^2).
%C A378623 In "Visualizing the Sum-Product Conjecture", the bound a(n) <= (1/4)*(24 - 40*n + 27*n^2 - 8*n^3 + n^4) = 0.25 n^4 -2 n^3 +O(n^2) is proved.
%C A378623 From "Visualizing the Sum-Product Conjecture": 153 <= a(7) <= 157, 305 <= a(8) <= 358, 543 <= a(9) <= 645, 914 <= a(10) <= 1081, 1444 <= a(11) <= 1711, 2185 <= a(12) <= 2586, 3198 <= a(13) <= 3763, 4520 <= a(14) <= 5305, 6233 <= a(15) <= 7281, 8400 <= a(16) <= 9766. - _Kevin O'Bryant_, Mar 10 2025
%H A378623 Kevin O'Bryant, <a href="https://arxiv.org/abs/2411.08139">Visualizing the sum-product conjecture</a>, arXiv:2411.08139 [math.NT], 2024.
%e A378623 For n=3, the a(3) = 3 pairs are (5,6), (6,6), (6,5).
%e A378623 For n=4, the a(4) = 10 pairs are (u,10), (u,9), (10,8), (10,7), where 7 <= u <= 10.
%K A378623 nonn,more,hard
%O A378623 1,3
%A A378623 _Kevin O'Bryant_, Dec 02 2024