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 A294575 #17 Jun 03 2018 02:07:07 %S A294575 144,162,174,186,192,198,200,204,216,220,222,228,230,234,238,240,246, %T A294575 250,252,258,260,264,266,270,276,280,282,288,290,294,300,306,308,310, %U A294575 312,318,320,322,324,330,336,340,342,348,350,354,360,364,366,370,372,374 %N A294575 Numbers n such that 2 * A243823(n) > n. %C A294575 Consider A243823(n), which is the number of m < n that are products of at least one prime p | n and at least one prime q that does not divide n. These numbers m in the cototient of n do not divide a power of n. This sequence lists numbers n where such numbers m are predominant. %H A294575 Michael De Vlieger, <a href="/A294575/b294575.txt">Table of n, a(n) for n = 1..10000</a> %e A294575 A272619(10) = (6), A243823(10) = 1, so 10 is not in the sequence. A243823(144) = 74, which is greater than half of all numbers less than or equal to 144, thus 144 is the first term. %t A294575 Select[Range[10^3], Function[n, 2 (n - (Count[Range@ n, _?(PowerMod[n, Floor@ Log2@ n, #] == 0 &)] + EulerPhi[n] - 1)) > n]] %Y A294575 Cf. A243823, A272619, A294576. %K A294575 nonn %O A294575 1,1 %A A294575 _Michael De Vlieger_, Nov 17 2017