OFFSET
1,1
COMMENTS
Lambda is the function in A002322. If there are infinitely many Sophie Germain primes (conjecture), then this sequence is infinite. Proof: The numbers of the form 3p^2 are in a subsequence if p and 2p+1 are both prime with p > 3, because from the property that lambda(3p^2) = p(p-1) and lambda (p(2p+1)) = p(p-1), if m = 3p^2 then lambda(m-phi(m)) = lambda (3p^2 - p(p-1)) = lambda(p(2p+1)) = p(p-1) = lambda(m).
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..1000
EXAMPLE
75 is in the sequence because lambda(75) = 20, lambda(75 - 20) = lambda(55) = 20.
MATHEMATICA
Select[Range[20000], CarmichaelLambda[ #] == CarmichaelLambda[ # - CarmichaelLambda[#] ] &]
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Lagneau, Mar 31 2011
STATUS
approved