login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..31.

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

Adjacent sequences:  A274510 A274511 A274512 * A274514 A274515 A274516

KEYWORD

nonn,more

AUTHOR

Arkadiusz Wesolowski, Jun 25 2016

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 13 08:08 EST 2019. Contains 329968 sequences. (Running on oeis4.)