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 A176462 #10 Feb 04 2019 02:12:39
%S A176462 0,17,19,29,31,41,43,49,51,53,55,65,67,69,71,77,79,89,91,97,99,101,
%T A176462 103,109,111,113,115,125,127,129,131,137,139,149,151,153,155,161,163,
%U A176462 169,171,173,175,181,183,185,187,189,191,197,199,209,211,221,223,229,231
%N A176462 Numbers k such that neither k-1 nor k+1 is prime or semiprime.
%C A176462 a(n+1) is the (n+2)-th odd sum of two consecutive nonnegative nonprimes.
%H A176462 Harvey P. Dale, <a href="/A176462/b176462.txt">Table of n, a(n) for n = 1..2000</a>
%F A176462 a(n+1) = A166685(n+2).
%e A176462 0 is a term because neither 0-1=-1 nor 0+1=1 is prime or semiprime.
%p A176462 isA001358 := proc(n) numtheory[bigomega](n) = 2 ; end proc: for n from 0 to 400 do if isA001358(n+1) or isA001358(n-1) or isprime(n+1) or isprime(n-1) then ; else printf("%d,",n) ; end if; end do: # _R. J. Mathar_, Apr 20 2010
%t A176462 Join[{0},Flatten[Position[Partition[Table[If[PrimeQ[n]||PrimeOmega[n] == 2,1,0],{n,250}],3,1],_?(#[[1]]==#[[3]]==0&),{1},Heads -> False]]+ 1] (* _Harvey P. Dale_, Oct 27 2015 *)
%Y A176462 Cf. A141468.
%K A176462 nonn
%O A176462 1,2
%A A176462 _Juri-Stepan Gerasimov_, Apr 18 2010
%E A176462 Entries checked by _R. J. Mathar_, Apr 20 2010