A033981 -id:A033981 - cp's OEIS frontend

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

1, 2, 4, 6, 8, 10, 12, 16, 18, 24, 30, 31, 32, 36, 42, 48, 64, 66, 72, 78, 84, 90, 96, 102, 114, 126, 138, 144, 168, 174, 176, 186, 192, 210, 222, 234, 246, 252, 258, 282, 288, 318, 336, 354, 366, 390, 396, 402, 426, 438, 456, 474, 496, 498, 504, 510, 534, 546

Offset: 1

Robert G. Wilson v

nonn

The odd terms are given by A215610.

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

T. D. Noe, Table of n, a(n) for n = 1..1000
OEIS Wiki, 2^n mod n

Contains A208154 as a subsequence.

Cf. A015919, A015921, A015922, A015924, A015925, A015927, A015929, A015931, A015932, A015935, A015937.

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

Edited by Max Alekseyev, Jul 30 2011

A124974 Integers n such that 2^n == 17 (mod n).

Original entry on oeis.org

1, 3, 5, 9, 45, 99, 53559, 1143357, 2027985, 36806085, 1773607905, 3314574181, 1045463125509, 1226640523999, 3567404505159, 28726885591099, 39880799734039, 87977068273719, 106436400721299, 339966033494859, 999567363539883

Offset: 1

Zak Seidov, Nov 14 2006

nonn

Some larger terms: 576541379659648320485

			2^45 = 17 + 45*781874935307,
2^99 = 17 + 99*6402275758728431320690420229.

Cf. A033981, A124965, A015911.

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

Terms 1, 3, 5, 9 prepended by Max Alekseyev, May 20 2011

a(11)-a(21) from Max Alekseyev, May 25 2012

A125000 Integers n such that 2^n == 19 (mod n).

Original entry on oeis.org

1, 17, 2873, 10081, 3345113, 420048673, 449349533, 2961432773, 19723772249, 821451792317, 1207046362769

Offset: 1

Zak Seidov, Nov 15 2006

No other terms below 10^15. Some larger terms: 500796684074966733196301. - Max Alekseyev, May 23 2012

Cf. A124974, A033981, A050259, A124977, A124965, A015911, A015910.

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

Terms 1, 17 prepended by Max Alekseyev, May 20 2011

a(8)-a(11) from Max Alekseyev, May 23 2012

A128126 Numbers k such that 2^k == 18 (mod k).

Original entry on oeis.org

1, 2, 14, 35, 77, 98, 686, 1715, 5957, 18995, 26075, 43921, 49901, 52334, 86555, 102475, 221995, 250355, 1228283, 1493597, 4260059, 6469715, 10538675, 15374219, 19617187, 22731275, 53391779, 60432239, 68597795, 85672139, 175791077

Offset: 1

Alexander Adamchuk, Feb 15 2007

nonn

Joe Crump (joecr(AT)carolina.rr.com) Table of n, a(n) for n = 1..50
Joe K. Crump, 2^n mod n

Cf. A015910, A036236, A050259 (numbers k such that 2^k == 3 (mod k)), A033981, A051447, A033982, A051446, A033983, A128121, A128122, A128123, A128124, A128125.

[1,2,14] cat [n: n in [1..10^8] | Modexp(2, n, n) eq 18]; // Vincenzo Librandi, Apr 05 2019

m = 18; Join[Select[Range[m], Divisible[2^# - m, #] &],
Select[Range[m + 1, 10^6], PowerMod[2, #, #] == m &]] (* Robert Price, Oct 08 2018 *)
Join[{1,2,14},Select[Range[86*10^6],PowerMod[2,#,#]==18&]] (* Harvey P. Dale, Feb 23 2025 *)

isok(n) = Mod(2, n)^n == 18; \\ Michel Marcus, Oct 09 2018

More terms from Joe Crump (joecr(AT)carolina.rr.com), Mar 04 2007

1, 2 and 14 added by N. J. A. Sloane, Apr 23 2007

A124977 Least positive number k such that 2^k mod k = 2n+1, or 0 if no such k exists.

Original entry on oeis.org

0, 4700063497, 19147, 25, 2228071, 262279, 95, 481, 45, 2873, 3175999, 555, 95921, 174934013, 777, 140039, 2463240427, 477, 91, 623, 2453, 55, 345119, 1131, 943, 21967, 135, 46979, 125, 3811, 23329, 155, 1064959, 245

Offset: 0

Zak Seidov, Nov 14 2006

nonn

			a(3) = 25 because 2^25 = 33554432 = 7 + 25*1342177.

Cf. A015910, A015911, A033981, A036236, A050259, A122182, A124965, A124974.

nk[n_] := Module[ {k}, k = 1;
  While[PowerMod[2, k, k] != 2 n + 1, k++]; k]
Join[{0}, Table[nk[i], {i, 1, 33}]]  (* Robert Price, Oct 11 2018 *)

A bisection of A036236: a(n) = A036236(2n+1).

Edited by Max Alekseyev, May 20 2011

A128125 Numbers k such that 2^k == 14 (mod k).

Original entry on oeis.org

1, 2, 3, 10, 1010, 61610, 469730, 2037190, 3820821, 9227438, 21728810, 24372562, 207034456857, 1957657325241, 2002159320610, 35169368880130, 36496347203230, 116800477091426

Offset: 1

Alexander Adamchuk, Feb 15 2007

No other terms below 10^15. Some larger terms: 279283702428813463, 3075304070192893442, 21894426987819404424310, 4616079845508388554313022889, 82759461944940747300611642693066719359651817521, 446*(2^445-7)/1061319625781480182060453906975 (107 digits). - Max Alekseyev, Oct 03 2016

Joe K. Crump, 2^n mod n

Cf. A015910, A036236, A050259 (numbers k such that 2^k == 3 (mod k)), A033981, A051447, A033982, A051446, A033983, A128121, A128122, A128123, A128124, A128126.

For[n=1, n<= 10^6, n++, If[PowerMod[2,n,n] == Mod[14,n], Print[n]]] (* Stefan Steinerberger, May 05 2007 *)
m = 14; Join[Select[Range[m], Divisible[2^# - m, #] &],
Select[Range[m + 1, 10^6], PowerMod[2, #, #] == m &]] (* Robert Price, Oct 08 2018 *)

1, 2, 3 and 10 added by N. J. A. Sloane, Apr 23 2007
More terms from Stefan Steinerberger, May 05 2007
a(13) from Max Alekseyev, May 15 2011
a(14), a(16), a(17) from Max Alekseyev, Dec 16 2013
a(15), a(18) from Max Alekseyev, Oct 03 2016

A240941 Numbers k that divide 2^k + 7.

Original entry on oeis.org

1, 3, 15, 75, 6308237, 871506915, 2465425275, 2937864075, 2948967789, 83313712623, 195392257275, 11126651718075, 45237726869109, 2920008144904215

Offset: 1

Derek Orr, Aug 04 2014

Some larger terms: 213736983815110866141, 23423890178454972202084722709155. - Max Alekseyev, Sep 23 2016

			2^3 + 7 = 15 is divisible by 3. Thus 3 is a term of this sequence.

OEIS Wiki, 2^n mod n

Cf. A033981, A168415.

k = 1; lst = {1,3}; While[k < 2500000001, If[ PowerMod[2, k, k] + 7 == k, AppendTo[ lst, k]; Print[ k]]; k += 2]; lst (* Robert G. Wilson v, Aug 05 2014 *)

for(n=1,10^9,if(Mod(2,n)^n==Mod(-7,n),print1(n,", ")))

a(7)-a(9) from Robert G. Wilson v, Aug 05 2014

a(10)-a(14) from Max Alekseyev, Sep 23 2016

A296370 Numbers m such that 2^m == 3/2 (mod m).

Original entry on oeis.org

1, 111481, 465793, 79036177, 1781269903307, 250369632905747, 708229497085909, 15673900819204067

Offset: 1

Max Alekseyev, Dec 11 2017

Equivalently, 2^(m+1) == 3 (mod m).
Also, numbers m such that 2^(m+1) - 2 is a Fermat pseudoprime base 2, i.e., 2^(m+1) - 2 belongs to A015919 and A006935.
Some larger terms (may be not in order): 2338990834231272653581, 341569682872976768698011746141903924998969680637.

OEIS Wiki, 2^n mod n

Solutions to 2^m == k (mod m): this sequence (k=3/2), A187787 (k=1/2), A296369 (k=-1/2), A000079 (k=0), A006521 (k=-1), A015919 (k=2), A006517 (k=-2), A050259 (k=3), A015940 (k=-3), A015921 (k=4), A244673 (k=-4), A128121 (k=5), A245318 (k=-5), A128122 (k=6), A245728 (k=-6), A033981 (k=7), A240941 (k=-7), A015922 (k=8), A245319 (k=-8), A051447 (k=9), A240942 (k=-9), A128123 (k=10), A245594 (k=-10), A033982 (k=11), A128124 (k=12), A051446 (k=13), A128125 (k=14), A033983 (k=15), A015924 (k=16), A124974 (k=17), A128126 (k=18), A125000 (k=19), A015925 (k=2^5), A015926 (k=2^6), A015927 (k=2^7), A015929 (k=2^8), A015931 (k=2^9), A015932 (k=2^10), A015935 (k=2^11), A015937 (k=2^12)

Select[Range[10^6], Divisible[2^(# + 1) - 3, #] &] (* Robert Price, Oct 11 2018 *)

a(n) = A296104(n) - 1.

A334634 Numbers m that divide 2^m + 11.

Original entry on oeis.org

1, 13, 16043199041, 91118493923, 28047837698634913

Offset: 1

Max Alekseyev, Sep 10 2020

Equivalently, numbers m such that 2^m == -11 (mod m).

No other terms below 10^17.

OEIS Wiki, 2^n mod n

Solutions to 2^n == k (mod n): A296370 (k=3/2), A187787 (k=1/2), A296369 (k=-1/2), A000079 (k=0), A006521 (k=-1), A015919 (k=2), A006517 (k=-2), A050259 (k=3), A015940 (k=-3), A015921 (k=4), A244673 (k=-4), A128121 (k=5), A245318 (k=-5), A128122 (k=6), A245728 (k=-6), A033981 (k=7), A240941 (k=-7), A015922 (k=8), A245319 (k=-8), A051447 (k=9), A240942 (k=-9), A128123 (k=10), A245594 (k=-10), A033982 (k=11), this sequence (k=-11), A128124 (k=12), A051446 (k=13), A128125 (k=14), A033983 (k=15), A015924 (k=16), A124974 (k=17), A128126 (k=18), A125000 (k=19), A015925 (k=2^5), A015926 (k=2^6), A015927 (k=2^7), A015929 (k=2^8), A015931 (k=2^9), A015932 (k=2^10), A015935 (k=2^11), A015937 (k=2^12).

a(5) from Sergey Paramonov, Oct 10 2021

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Extensions

A124974 Integers n such that 2^n == 17 (mod n).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions

A125000 Integers n such that 2^n == 19 (mod n).

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

Extensions

A128126 Numbers k such that 2^k == 18 (mod k).

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Extensions

A124977 Least positive number k such that 2^k mod k = 2n+1, or 0 if no such k exists.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Formula

Extensions

A128125 Numbers k such that 2^k == 14 (mod k).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Extensions

A240941 Numbers k that divide 2^k + 7.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A296370 Numbers m such that 2^m == 3/2 (mod m).

Views

Author

Keywords

Comments

Links

Crossrefs