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!)
A274514 a(n) is the only number m such that 12^(2^m) + 1 is divisible by A273950(n). 0
1, 0, 3, 1, 2, 3, 2, 7, 5, 6, 12, 15, 6, 4, 14, 3, 11, 11, 18, 8, 12, 19, 18, 6, 12, 18, 19, 11, 21, 10, 19, 29, 8, 26, 16, 4, 38, 21, 23, 39, 14, 42, 40, 30 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
PROG
(PARI) forstep(p=3, 10^15, 2, if(!Mod(p, 3)==0, if(isprime(p), o=znorder(Mod(12, p)); x=ispower(2*o); if(2^(x-1)==o, print1(x-2, ", ")))));
CROSSREFS
Cf. A273950.
Sequence in context: A305391 A165084 A029279 * A342932 A026181 A327239
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 25 07:07 EDT 2024. Contains 371964 sequences. (Running on oeis4.)