|
|
A353886
|
|
Nonnegative numbers k such that k^2 + k + 1 is squarefree.
|
|
3
|
|
|
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 19, 20, 21, 23, 24, 25, 26, 27, 28, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 69, 70, 71, 72
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
Dimitrov proved that this sequence is infinite.
The number of terms not exceeding X is Product_{p prime} (1 - A000086(p)/p^2) * X + O(X^(4/5+eps)) (Dimitrov, 2023). The coefficient of X, which is the asymptotic density of this sequence, equals Product_{primes p == 1 (mod 3)} (1 - 2/p^2) = 0.93484201367... . - Amiram Eldar, Dec 11 2023
|
|
LINKS
|
|
|
EXAMPLE
|
For k = 4, 4^2 + 4 + 1 = 21 = 3 * 7 is squarefree, so 4 belongs to this sequence.
|
|
MATHEMATICA
|
Select[Range[0, 72], SquareFreeQ[#^2 + # + 1] &] (* Amiram Eldar, Dec 11 2023 *)
|
|
PROG
|
(PARI) is(k) = issquarefree(k^2 + k + 1);
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|