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.

A273949 Odd prime factors of generalized Fermat numbers of the form 11^(2^m) + 1 with m >= 0.

Original entry on oeis.org

3, 17, 61, 193, 257, 7321, 15361, 51329, 65537, 163841, 6304673, 15190529, 70254593, 1691123713, 1760464897, 3221225473, 3489660929, 4696846849, 6874464257, 53401878529, 111489577217, 149300051969, 184683593729, 206158430209, 447600088289, 1819992391681
Offset: 1

Views

Author

Arkadiusz Wesolowski, Jun 05 2016

Keywords

Comments

Odd primes p other than 5 such that the multiplicative order of 11 (mod p) is a power of 2.

References

  • Hans Riesel, Common prime factors of the numbers A_n=a^(2^n)+1, BIT 9 (1969), pp. 264-269.

Crossrefs

Cf. A023394, A072982, A199592, A273945 (base 3), A273946 (base 5), A273947 (base 6), A273948 (base 7), A273950 (base 12).

Programs

  • Mathematica
    Delete[Select[Prime@Range[2, 10^5], IntegerQ@Log[2, MultiplicativeOrder[11, #]] &], 2]