This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A343825 #22 Jun 14 2021 15:56:28 %S A343825 0,0,1,0,1,2,0,1,6,3,0,1,4,8,4,0,1,4,6,4,5,0,1,4,6,9,10,6,0,1,4,6,4, %T A343825 10,12,7,0,1,4,6,8,10,12,14,8,0,1,4,6,4,10,9,14,15,9,0,1,4,6,8,10,9, %U A343825 14,8,9,10,0,1,4,6,4,10,12,14,15,16,18,11,0,1,4 %N A343825 Table read by antidiagonals upward: T(n,k) is the least m such that there exists a sequence k = b_1 <= b_2 <= ... <= b_t = m such that no term appears n or more times and the product of the sequence is of the form c^n, where c is an integer; n >= 1 and k >= 0. %C A343825 For each prime p, the p-th row is a permutation of the nonprime integers. %C A343825 T(n,k) <= A343881(n,k). %C A343825 Conjecture: T(p,k) = A071537(k) for fixed k and sufficiently large prime p. %e A343825 Table begins: %e A343825 n\k | 0 1 2 3 4 5 6 7 8 9 10 %e A343825 ------+-------------------------------------- %e A343825 1 | 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 %e A343825 2 | 0, 1, 6, 8, 4, 10, 12, 14, 15, 9, 18 %e A343825 3 | 0, 1, 4, 6, 9, 10, 12, 14, 8, 16, 15 %e A343825 4 | 0, 1, 4, 6, 4, 10, 9, 14, 15, 9, 18 %e A343825 5 | 0, 1, 4, 6, 8, 10, 9, 14, 12, 15, 16 %e A343825 6 | 0, 1, 4, 6, 4, 10, 12, 14, 8, 9, 15 %e A343825 7 | 0, 1, 4, 6, 8, 10, 9, 14, 12, 15, 16 %e A343825 8 | 0, 1, 4, 6, 4, 10, 9, 14, 12, 9, 16 %e A343825 Specifically, %e A343825 T(2,3) = 8 because 3 * 6 * 8 = 12^2, %e A343825 T(3,3) = 6 because 3 * 4^2 * 6^2 = 12^3, %e A343825 T(3,5) = 10 because 5 * 6 * 9 * 10^2 = 30^3, %e A343825 T(4,6) = 9 because 6^2 * 8^2 * 9^3 = 36^4, and %e A343825 T(4,9) = 9 because 9^2 = 3^4. %Y A343825 Row n: A001477 (n=1), A006255 (n=2), A277494 (n=3), A328045 (n=4). %Y A343825 Cf. A071537. %K A343825 nonn,tabl %O A343825 1,6 %A A343825 _Peter Kagey_, Apr 30 2021