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 A097636 #10 Jan 24 2013 03:05:43
%S A097636 9,15,21,27,35,39,45,51,57,65,69,77,81,87,93,99,105,111,121,129,135,
%T A097636 145,155,161,165,171,177,187,195,205,217,225,231,237,247,255,261,267,
%U A097636 275,279,289,301,309,315,325,335,343,351,357,363,371,377,381,387,393,399
%N A097636 Odd composites of the form A024675(k) or 1+A024675(k), any k.
%C A097636 Start from an auxiliary sequence of interprimes, incremented by 1 if even: 5, 7, 9, 13, 15, 19, 21, 27, 31,... Removing the primes from this auxiliary sequence of odd numbers yields the current sequence.
%t A097636 digits=200 (* find odd numbers between the primes nearest the average*) a=Table[If[(Mod[(Prime[n+1]+Prime[n])/2, 2]==1)&&( PrimeQ[(Prime[n+1]+Prime[n])/2]==False)&&( PrimeQ[(Prime[n+1]+Prime[n])/2+1]==False), (Prime[n+1]+Prime[n])/2, (Prime[n+1]+Prime[n])/2+1], {n, 2, digits}] b=Table[Prime[n], {n, 1, digits}] (* eliminate the primes from the sequence *) aa=Complement[a, b]
%K A097636 nonn,easy,less
%O A097636 1,1
%A A097636 _Roger L. Bagula_, Sep 20 2004
%E A097636 Definition clarified by the Assoc. Eds. of the OEIS, Jul 13 2010