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.

A274513 a(n) is the only number m such that 11^(2^m) + 1 is divisible by A273949(n).

Original entry on oeis.org

0, 3, 1, 5, 5, 2, 7, 4, 15, 14, 3, 8, 19, 11, 10, 24, 27, 8, 19, 23, 7, 16, 31, 35, 4, 29, 28, 11, 11, 28, 35
Offset: 1

Views

Author

Arkadiusz Wesolowski, Jun 25 2016

Keywords

Crossrefs

Cf. A273949.

Programs

  • PARI
    forstep(p=3, 10^15, 2, if(!Mod(p, 11)==0, if(isprime(p), o=znorder(Mod(11, p)); x=ispower(2*o); if(2^(x-1)==o, print1(x-2, ", ")))));