cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A274512 a(n) is the only number m such that 10^(2^m) + 1 is divisible by A072982(n+1).

Original entry on oeis.org

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
Offset: 1

Views

Author

Arkadiusz Wesolowski, Jun 25 2016

Keywords

Crossrefs

Programs

  • 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, ", ")))));

Formula

a(n) = A197224(n+1) - 1. - Ray Chandler, Oct 25 2019