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 A115036 #14 Mar 02 2015 02:28:16
%S A115036 6,10,14,18,20,22,26,28,30,34,36,38,42,44,46,50,52,54,58,60,62,66,68,
%T A115036 70,72,74,76,78,82,84,86,88,90,92,94,98,100,102,104,106,108,110,114,
%U A115036 116,118,120,122,124,126,130,132,134,136,138,140,142,146,148,150,152
%N A115036 Even terms of A116883.
%C A115036 The union of this sequence and the sequence of odd positive integers is sequence A116883.
%H A115036 Charles R Greathouse IV, <a href="/A115036/b115036.txt">Table of n, a(n) for n = 1..10000</a>
%e A115036 The highest odd divisor of 20 (which is 5) is greater than the highest power of 2 dividing 20 (which is 4) and 20 is even, so 20 is in this sequence.
%t A115036 a = {}; For[n = 2, n < 200, n = n + 2, If[Select[Divisors[n], OddQ[ # ] &][[ -1]]^2 > n - 1, AppendTo[a, n]]]; a (* _Stefan Steinerberger_, Oct 16 2007 *)
%o A115036 (PARI) list(lim)=my(v=List(),t,M);forstep(k=3,lim\2,2,t=k+k;M=min(lim,k^2);while(t<=M,listput(v,t);t+=t));vecsort(Vec(v)) \\ _Charles R Greathouse IV_, Mar 16 2011
%Y A115036 Cf. A116883.
%K A115036 nonn,easy
%O A115036 1,1
%A A115036 _Leroy Quet_, Feb 26 2006
%E A115036 More terms from _Stefan Steinerberger_, Oct 16 2007