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!)
A274512 a(n) is the only number m such that 10^(2^m) + 1 is divisible by A072982(n+1). 1
0, 3, 2, 1, 2, 7, 4, 4, 4, 4, 8, 7, 5, 15, 4, 7, 5, 9, 15, 3, 5, 8, 16, 19, 20, 17, 9, 12, 18, 6, 26, 8, 29, 8, 11, 19, 29, 35, 19, 40, 22, 41, 40, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = A197224(n+1) - 1. - Ray Chandler, Oct 25 2019
PROG
(PARI) forstep(p=3, 10^15, 2, if(!Mod(p, 5)==0, if(isprime(p), o=znorder(Mod(10, p)); x=ispower(2*o); if(2^(x-1)==o, print1(x-2, ", ")))));
CROSSREFS
Sequence in context: A127318 A362689 A349930 * A175947 A085068 A265027
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 19 10:56 EDT 2024. Contains 371791 sequences. (Running on oeis4.)