login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A069254
k/10 when gcd(k, 2^k+1) = 5.
2
1, 3, 7, 9, 11, 13, 17, 19, 21, 23, 27, 29, 31, 33, 37, 43, 47, 49, 51, 53, 57, 59, 61, 63, 67, 69, 71, 73, 77, 79, 81, 83, 87, 89, 91, 93, 97, 99, 101, 103, 107, 109, 111, 113, 119, 121, 127, 129, 131, 133, 137, 139, 141, 143, 147, 149, 151, 153, 157, 159, 161, 163
OFFSET
1,2
COMMENTS
The number of terms not exceeding 10^m, for m = 1, 2, ..., are 4, 38, 371, 3726, 37259, 372542, 3725411, 37254006, 372539990, ... . Apparently, the asymptotic density of this sequence exists and equals 0.3725... . - Amiram Eldar, Jun 14 2022
LINKS
MATHEMATICA
Select[Range[170], GCD[10*#, PowerMod[2, 10*#, 10*#] + 1] == 5 &] (* Amiram Eldar, Jun 14 2022*)
PROG
(PARI) lista(nn) = select(x->(gcd(x, 2^x+1) == 5), [1..nn])/10 \\ Michel Marcus, Oct 27 2019
CROSSREFS
Cf. A069226.
Sequence in context: A288444 A085820 A045572 * A105585 A080903 A172253
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Apr 13 2002
STATUS
approved