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 A140461 #11 Feb 02 2015 03:56:11
%S A140461 1,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,
%T A140461 103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,
%U A140461 193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281
%N A140461 Numbers in A008364 but not in A038511.
%p A140461 isA008364 := proc(n) if n = 1 then true; else min( op(numtheory[factorset](n)) ); if % > 7 then true; else false; end if; end if; end proc:
%p A140461 isA038511 := proc(n) if n = 1 then false; else min( op(numtheory[factorset](n)) ); if % >= 11 and not isprime(n) then true; else false; end if; end if; end proc:
%p A140461 for n from 1 to 300 do if isA008364(n) and not isA038511(n) then printf("%d,",n) ; end if; end do: # _R. J. Mathar_, Apr 25 2010
%o A140461 (PARI) a(n)=if(n==1,1,prime(n+3)) \\ _Charles R Greathouse IV_, Aug 26 2011
%K A140461 nonn,easy
%O A140461 1,2
%A A140461 _Juri-Stepan Gerasimov_, Jul 22 2008
%E A140461 Entries checked by _R. J. Mathar_, Apr 25 2010