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!)
A274508 a(n) is the only number m such that 3^(2^m) + 1 is divisible by A273945(n). 0
1, 3, 2, 3, 7, 8, 10, 15, 7, 15, 11, 8, 19, 4, 9, 21, 10, 11, 10, 26, 28, 9, 29, 32, 31, 38, 9, 39, 34, 21, 7, 31, 26, 36, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

PROG

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

CROSSREFS

Cf. A273945.

Sequence in context: A071010 A215934 A323895 * A227104 A171721 A225695

Adjacent sequences:  A274505 A274506 A274507 * A274509 A274510 A274511

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 14 19:27 EST 2019. Contains 329987 sequences. (Running on oeis4.)