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 A219110 #15 Dec 23 2024 14:53:43
%S A219110 10,13,15,17,18,19,22,24,26,27,28,31,33,35,36,37,39,40,42,44,45,46,48,
%T A219110 51,53,54,55,57,59,60,62,63,64,66,68,69,71,72,73,75,77,78,79,80,81,82,
%U A219110 84,86,87,88,90,91,93,95,96,97,99,100,101,102,103,104,105
%N A219110 Numbers for which at least one sum of two adjacent digits is not prime.
%C A219110 Different from A104211 where ("only") the sum of all digits is considered; of course exactly the two-digit terms coincide.
%C A219110 Numbers missing in A182177 and A182178. Otherwise said, complement of the range of A182177 (in the set of nonnegative integers) and of the range of A182178 (in the set of positive integers) and of A182175 in the set of integers > 9.
%H A219110 M. F. Hasler in reply to E. Angelini, <a href="https://web.archive.org/web/*/http://list.seqfan.eu/oldermail/seqfan/2013-April/011036.html">Re: Any digit-pair in S sums to a prime</a>, SeqFan list, Apr 11 2013
%e A219110 102 is here because 1+0 is not prime (even though 0+2 is).
%t A219110 Select[Range[10, 105], MemberQ[PrimeQ[Total /@ Partition[IntegerDigits[#], 2, 1]], False] &] (* _T. D. Noe_, Apr 16 2013 *)
%o A219110 (PARI) is(n)=for(i=2,#n=digits(n),isprime(n[i-1]+n[i])||return(1))
%K A219110 nonn,base,easy
%O A219110 1,1
%A A219110 _M. F. Hasler_, Apr 11 2013