A215610 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A215610

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

1, 31, 18631, 55831, 92329, 3014633, 3556559, 6429121, 9664591, 12158831, 33554431, 34844431, 566740481, 644903881, 727815241, 842608801, 2207017049, 2208171881, 2445644207, 8694918511, 9031128791, 18738146881, 27345981361, 35476604081

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

Also, the odd solutions to 2^(n-6) == 1 (mod n). The only even solution is n=6.

For all m, 2^A033981(m)-1 belongs to this sequence.

LINKS

Max Alekseyev, Table of n, a(n) for n = 1..102 (all terms below 10^14)

MATHEMATICA

m = 64; Join[Select[Range[1, m, 2], Divisible[2^# - m, #] &],

Select[Range[m + 1, 10^6, 2], PowerMod[2, #, #] == m &]] (* Robert Price, Oct 08 2018 *)

CROSSREFS