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 A238367 #17 Oct 19 2017 10:43:07 %S A238367 30,42,66,70,78,90,102,110,114,126,130,138,150,154,170,174,182,186, %T A238367 190,198,210,222,230,234,238,246,258,266,270,282,286,290,294,306,310, %U A238367 318,322,330,342,350,354,366,370,374,378,390,402,406,410,414,418,420,426,430,434,438,442,450,462,470,474,490,494,498 %N A238367 Even numbers n such that n is not divisible by 2^d where d is the number of distinct odd prime factors of n. %C A238367 Inspired by comment by _Don Reble_ in A072995. %C A238367 2*A061346 = A238367 with the exceptions of 420, 660, 780, 924, 1020, 1092, 1140, 1260, ... . %e A238367 30 is in the sequence because the odd primes that divide 30 are 3 and 5, but 2^2 does not divide 30. %t A238367 Select[2 Range[250], Mod[#, 2^(PrimeNu[#] - 1)] != 0 &] %Y A238367 Cf. A072995. %K A238367 nonn %O A238367 1,1 %A A238367 _Robert G. Wilson v_, Feb 25 2014