This site is supported by donations to The OEIS Foundation.

 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!)
 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 Cf. A072982, A197224. Sequence in context: A230120 A136531 A127318 * A175947 A085068 A265027 Adjacent sequences:  A274509 A274510 A274511 * A274513 A274514 A274515 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.

Last modified December 8 08:49 EST 2019. Contains 329862 sequences. (Running on oeis4.)