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.

A215612 Odd integers n such that 2^n == 2^10 (mod n).

Original entry on oeis.org

1, 7, 73, 9271, 3195367, 6769801, 15413863, 24540337, 47424961, 52268743, 146583343, 384586849, 469501471, 475882081, 859764727, 1097475991, 1169323417, 1400034919, 2518532047, 2870143993, 3258854623, 5609707729, 6022970047, 6420870271, 9011348521
Offset: 1

Views

Author

Max Alekseyev, Aug 17 2012

Keywords

Comments

Also, the odd solutions to 2^(n-10) == 1 (mod n). The only even solution is n=10.
For all m, 2^A033982(m)-1 belongs to this sequence.

Crossrefs

The odd terms of A015932.

Programs

  • Mathematica
    m = 2^10; Join[Select[Range[1, m, 2], Divisible[2^# - m, #] &], Select[Range[m + 1, 10^7, 2], PowerMod[2, #, #] == m &]] (* Robert Price, Oct 15 2018 *)