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 A328998 #9 Nov 14 2019 19:54:06 %S A328998 17,43,71,103,313,347,569,601,661,859,883,1289,1381,1489,1699,1789, %T A328998 1873,2143,2347,2381,2383,2393,2593,2687,2711,2731,2753,2837,3011, %U A328998 3121,3169,3257,3259,3463,3559,3583,3671,3769,3919,4057,4159,4219,4423 %N A328998 Primes that never appear as sums of terms in successive triples in A329333. %C A328998 Sort A328997, remove duplicates, then list the missing primes. %C A328998 Since we know that the first 20000 terms of A329333 are distinct, in order to show that a prime p is missing from the sums of pairs of terms of A329333, we only need to check until the terms of A329333 exceed p. %e A328998 A329333 begins 0, 1, 2, 7, 3, 6, 4, 5, 8, 10, 11, 9, 12, 14, 15, 13, 18, 17, 19, 20, ... %e A328998 so we see the primes 2, 3, 5, 13, 7, 11, 13, 13, ... But we do not see 17, and once we have seen all the numbers below 17 in A329333, we know 17 will never appear as a sum of two terms. %Y A328998 Cf. A328997, A329333. %K A328998 nonn %O A328998 1,1 %A A328998 _N. J. A. Sloane_, Nov 14 2019