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!)
A274509 a(n) is the only number m such that 5^(2^m) + 1 is divisible by A273946(n). 0
0, 1, 3, 7, 2, 5, 6, 4, 3, 9, 15, 13, 17, 11, 8, 19, 18, 11, 9, 4, 16, 5, 23, 24, 17, 19, 17, 5, 36, 6, 32, 23, 34, 40, 41, 39, 25 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

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

PROG

(PARI) forstep(p=3, 10^15, 2, if(!Mod(p, 5)==0, if(isprime(p), o=znorder(Mod(5, p)); x=ispower(2*o); if(2^(x-1)==o, print1(x-2, ", ")))));

CROSSREFS

Cf. A273946.

Sequence in context: A064824 A226521 A091723 * A016618 A130789 A023529

Adjacent sequences:  A274506 A274507 A274508 * A274510 A274511 A274512

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 5 16:12 EST 2019. Contains 329753 sequences. (Running on oeis4.)