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 A329590 #29 Mar 04 2020 12:54:05
%S A329590 1,3,5,7,9,33,57,93,99,129,141,153,177,183,195,213,225,243,255,261,
%T A329590 267,273,297,309,327,333,351,369,393,411,423,435,453,477,489,501,513,
%U A329590 519,525,537,561,573,591,597,603,633,645,657,663,675,687,693,705,711,723
%N A329590 Odd numbers k that cannot be expressed as k = p+q+r, with p prime and (q, r) a pair of twin primes.
%e A329590 33 can be expressed as the sum of three primes in 9 different ways:
%e A329590 33 = 11 + 11 + 11 = 13 + 13 + 7 = 17 + 11 + 5 = 17 + 13 + 3 = 19 + 7 + 7 = 19 + 11 + 3 = 23 + 5 + 5 = 23 + 7 + 3 = 29 + 2 + 2;
%e A329590 there is no pair of twin primes in the addends, so 33 is a term.
%o A329590 (PARI) for(n = 0, 500, m = 2*n+1; v = 0; forprime(i = 3, m-8, j = (m-i)/2; if(isprime(j-1) && isprime(j+1), v = 1)); if(v == 0, print1(m,", ")))
%o A329590 (PARI) isok(k) = {if (! (k % 2), return (0)); forprime(p=3, k, if (isprime((k-p)\2-1) && isprime((k-p)\2+1), return(0));); return (1);} \\ _Michel Marcus_, Feb 16 2020
%Y A329590 Cf. A001359, A034961, A054735, A068307, A124868.
%K A329590 nonn
%O A329590 1,2
%A A329590 _Antonio Roldán_, Feb 13 2020