|
|
A354558
|
|
Numbers k such that k and k+1 are both divisible by the square of their largest prime factor.
|
|
9
|
|
|
8, 49, 242, 288, 675, 1444, 1681, 2400, 2645, 6727, 6859, 9408, 9800, 10647, 12167, 13689, 18490, 23762, 24299, 26010, 36517, 47915, 48734, 57121, 58080, 59535, 75809, 85697, 101250, 103246, 113568, 118579, 131043, 142884, 158949, 182182, 201019, 212194, 235224
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Numbers k such that P(k)^2 | k and P(k+1)^2 | (k+1), where P(k) = A006530(k).
|
|
LINKS
|
|
|
FORMULA
|
x^(1/4)/log(x) << N(x) << x*exp(-c*sqrt(2*log(x)*log(log(x)))), where N(x) is the number of terms <= x, c = 25/24 (De Koninck et al., 2013), or 4/sqrt(5) (de la Bretèche and Drappeau, 2020).
|
|
EXAMPLE
|
8 = 2^3 is a term since P(8) = 2 and 2^2 | 8, 9 = 3^2, P(9) = 3 and 3^2 | 9.
675 = 3^3 * 5^2 is a term since P(675) = 5, 5^2 | 675, 676 = 2^2 * 13^2, P(676) = 13 and 13^2 | 676.
|
|
MATHEMATICA
|
q[n_] := FactorInteger[n][[-1, 2]] > 1; Select[Range[250000], q[#] && q[# + 1] &]
|
|
PROG
|
(Python)
from sympy import factorint
def c(n): f = factorint(n); return f[max(f)] >= 2
def ok(n): return n > 1 and c(n) and c(n+1)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|