login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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
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: A343231 A215934 A323895 * A347112 A227104 A171721
KEYWORD
nonn,more
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 03:03 EDT 2024. Contains 371917 sequences. (Running on oeis4.)