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”).

A274513
a(n) is the only number m such that 11^(2^m) + 1 is divisible by A273949(n).
0
0, 3, 1, 5, 5, 2, 7, 4, 15, 14, 3, 8, 19, 11, 10, 24, 27, 8, 19, 23, 7, 16, 31, 35, 4, 29, 28, 11, 11, 28, 35
OFFSET
1,2
PROG
(PARI) forstep(p=3, 10^15, 2, if(!Mod(p, 11)==0, if(isprime(p), o=znorder(Mod(11, p)); x=ispower(2*o); if(2^(x-1)==o, print1(x-2, ", ")))));
CROSSREFS
Cf. A273949.
Sequence in context: A072919 A273171 A244420 * A104489 A067285 A067286
KEYWORD
nonn,more
AUTHOR
STATUS
approved