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 A325237 #8 Apr 20 2019 03:02:36
%S A325237 2,6,10,105,165,195,4641,5187,5313,266133,8870433,3068957045,11063481,
%T A325237 10164297,667797009,909411789,32221169781185,1963007211216415,
%U A325237 421522466365,3012887561310445
%N A325237 Squarefree k such that 1/2 - phi(k)/k is positive and minimal for k with gpf(k) = prime(n).
%C A325237 Let gpf(k) = A006530(k) and let phi(n) = A000010(n) for k in A005117. There are 2^(n-1) numbers k with gpf(k) = n, since we can only either have p_i^0 or p_i^1 where p_i | k and i <= n. For example, for n = 2, there are only 2 squarefree numbers k with prime(2) = 3 as greatest prime factor. These are 3 = 2^0 * 3^1, and 6 = 2^1 * 3^1. We observe that we can write multiplicities of the primes as A067255(k), and thus for the example derive 3 = "0,1" and 6 = "1,1". Thus for n = 3, we have 5 = "0,0,1", 15 = "0,1,1", 10 = "1,0,1", and 30 = "1,1,1". This establishes the possible values of k with respect to n. We choose the value of k in n for which 1/2 - phi(k)/k is positive and minimal.
%C A325237 We know that prime k (in A000040) have phi(k)/k = A006093(n)/A000040(n) and represent maxima in n. We likewise know primorials k (in A002110) have phi(k)/k = A038110(n)/A060753(n) and represent minima in n. This sequence shows squarefree numbers k with gpf(k) = n such that their value phi(k)/k is closest to but less than 1/2.
%C A325237 Conjecture: for n > 3, k is always odd. This assertion is reliant upon phi(2 prime(n))/2 prime(n) = phi(2)/2 * phi(prime(n))/prime(n) = 1/2 * (prime(n) - 1)/prime(n), and it is clear that 1/2 is an asymptote for even k.
%H A325237 Michael De Vlieger, <a href="/A325237/a325237.png">Plot of A325237(n) among terms in row n of A307540</a>.
%e A325237 First terms of this sequence appear in the chart below between asterisks.
%e A325237 The values of n appear in the header, values of k followed parenthetically by phi(k)/k appear in column n. The x axis plots k according to primepi(gpf(k)), while the y axis plots k according to phi(k)/k:
%e A325237 0 1 2 3 4
%e A325237 . . . . .
%e A325237 --- 1 ------------------------------------------------
%e A325237 (1/1) . . . .
%e A325237 . . . . .
%e A325237 . . . . .
%e A325237 . . . . 7
%e A325237 . . . 5 (6/7)
%e A325237 . . . (4/5) .
%e A325237 . . . . .
%e A325237 . . . . 35
%e A325237 . . 3 . (24/35)
%e A325237 . . (2/3) . .
%e A325237 . . . . .
%e A325237 . . . . .
%e A325237 . . . . 21
%e A325237 . . . . (4/7)
%e A325237 . . . 15 .
%e A325237 . . . (8/15) .
%e A325237 . *2* . . .
%e A325237 ----------(1/2)---------------------------------------
%e A325237 . . . . .
%e A325237 . . . . *105*
%e A325237 . . . . (16/35)
%e A325237 . . . . 14
%e A325237 . . . *10* (3/7)
%e A325237 . . . (2/5) .
%e A325237 . . . . .
%e A325237 . . . . 70
%e A325237 . . *6* . (12/35)
%e A325237 . . (1/3) . .
%e A325237 . . . . 42
%e A325237 . . . 30 (2/7)
%e A325237 . . . (4/15) .
%e A325237 . . . . 210
%e A325237 . . . . (8/35)
%e A325237 ...
%e A325237 a(3) = 10 for the following reasons. There are 4 possible values of k with n = 3. These are 5, 15, 10, and 30 with phi(k)/k = 4/5, 8/15, 2/5, and 4/15, respectively. Subtracting each of the latter values from 1/2, we derive -3/10, -1/30, 1/10, and 7/30 respectively. Since the smallest of these differences is 1/10 pertaining to k = 10, a(3) = 10.
%t A325237 With[{e = 20}, Map[MinimalBy[#, If[# > 0, # + 1, Abs@ #] &[#[[2]] - 1/2] &] &, SplitBy[#, Last]] &@ Array[{#2, EulerPhi[#2]/#2, If[! IntegerQ@ #, 0, #] &[1 + Floor@ Log2@ #1]} & @@ {#, Times @@ MapIndexed[Prime[First@ #2]^#1 &, Reverse@ IntegerDigits[#, 2]]} &, 2^e - 1]][[All, 1, 1]]
%Y A325237 Cf. A000010, A000040, A002110, A005117, A006093, A006530, A038110, A060753, A307540, A325236.
%K A325237 nonn
%O A325237 1,1
%A A325237 _Michael De Vlieger_, Apr 19 2019