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.

A015932 Positive integers n such that 2^n == 2^10 (mod n).

Original entry on oeis.org

1, 2, 4, 6, 7, 8, 10, 12, 16, 24, 28, 30, 32, 34, 48, 50, 64, 70, 73, 96, 110, 112, 128, 130, 150, 170, 190, 192, 230, 256, 290, 310, 330, 370, 384, 410, 430, 442, 448, 470, 512, 530, 532, 550, 590, 610, 670, 710
Offset: 1

Views

Author

Keywords

Comments

The odd terms are given by A215612.
For all m, 2^A033982(m)-1 belongs to this sequence.

Crossrefs

Programs

  • Mathematica
    Select[Range[1000], Mod[2^# - 2^10, #] == 0 &] (* T. D. Noe, Aug 17 2012 *)

Extensions

Edited by Max Alekseyev, Jul 30 2011