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 A363342 #27 Feb 19 2025 12:12:23 %S A363342 5,16,10,24,18,17,36,26,23,28,48,31,29,34,41,60,35,33,-1,47,58,78,39, %T A363342 37,40,70,64,77,84,80,41,55,53,72,87,100 %N A363342 Array read by descending antidiagonals. A(n,k), n > 1 and k > 0, is the least m such that the number of partitions of m into n distinct prime parts is exactly k, or -1 if no such number exists. %e A363342 A(2, 1) = 5 = 2 + 3, because 5 is the least number for which there exists exactly one partition into 2 distinct primes. %e A363342 A(2, 2) = 16 = 3 + 13 = 5 + 11, because 16 is the least number for which there exist exactly 2 partitions into 2 distinct primes. %e A363342 Array begins: %e A363342 2: 5, 16, 24, 36, 48, 60, 78, 84, ... %e A363342 3: 10, 18, 26, 31, 35, 39, 80, ... %e A363342 4: 17, 23, 29, 33, 37, 41, ... %e A363342 5: 28, 34, -1, 40, 55, ... %e A363342 6: 41, 47, 70, 53, ... %e A363342 7: 58, 64, 72, ... %e A363342 8: 77, 87, ... %e A363342 9: 100, ... %Y A363342 Cf. A000586, A000607, A358010. %K A363342 sign,tabl,more %O A363342 2,1 %A A363342 _Jean-Marc Rebert_, May 28 2023