OFFSET
1,1
COMMENTS
Numbers k such that core(sigma(k)) = k + 1 where core(k) is the squarefree part of k (A007913). - Benoit Cloitre, May 01 2002
This sequence is infinite and its relative density in the sequence of primes is equal to Artin's constant (A005596): Product_{p prime} (1-1/(p*(p-1))) = 0.373955... (Mirsky, 1949). - Amiram Eldar, Dec 29 2020
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
Leon Mirsky, The number of representations of an integer as the sum of a prime and a k-free integer, The American Mathematical Monthly, Vol. 56, No. 1 (1949), pp. 17-19.
FORMULA
A160696(a(n)) = 1. - Reinhard Zumkeller, May 24 2009
a(n) = A077067(n)-1. - Zak Seidov, Mar 19 2016
EXAMPLE
29 is included since 29 + 1 = 30 = 2*3*5 is squarefree.
17 is not here because 18 is divisible by a square, 9.
MAPLE
N:= 10000; # to get all entries up to N
A049097:= select(t -> isprime(t) and numtheory:-issqrfree(t+1), [2, seq(1+2*k, k=1..floor((N-1)/2))]); # Robert Israel, May 11 2014
MATHEMATICA
Select[Prime[Range[100]], SquareFreeQ[# + 1] &] (* Zak Seidov, Feb 08 2016 *)
PROG
(Magma) [ p: p in PrimesUpTo(900) | IsSquarefree(p+1) ]; // Vincenzo Librandi, Dec 25 2010
(PARI) lista(nn) = forprime(p=1, nn, if (issquarefree(p+1), print1(p, ", "))); \\ Michel Marcus, Jan 08 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved