A130422 -id:A130422 - cp's OEIS frontend

A116629 Positive integers k such that 13^k == 3 (mod k).

1, 2, 5, 166, 287603, 9241538, 2366680105, 8347156585, 21682897793, 6988245760865, 9045859950329, 10076294257985, 50299408064905, 254874726648713

Offset: 1

Zak Seidov, Feb 19 2006

No other terms below 10^15. - Max Alekseyev, Nov 24 2017

Some larger terms: 1440926367749746685, 76025040962646716305439353859479569558065. - Max Alekseyev, Jun 29 2011

Cf. A116609, A050259, A122780, A130422, A123061, A277554.

Solutions to 13^n == k (mod n): A001022 (k=0), A015963 (k=-1), A116621 (k=1), A116622 (k=2), this sequence (k=3), A116630 (k=4), A116611 (k=5), A116631 (k=6), A116632 (k=7), A295532 (k=8), A116636 (k=9), A116620 (k=10), A116638 (k=11), A116639 (k=15).

Join[{1, 2}, Select[Range[1, 5000], Mod[13^#, #] == 3 &]] (* G. C. Greubel, Nov 19 2017 *)
Join[{1, 2}, Select[Range[10000000], PowerMod[13, #, #] == 3 &]] (* Robert Price, Apr 10 2020 *)

isok(n) = Mod(13, n)^n == 3; \\ Michel Marcus, Nov 19 2017

Two more terms from Ryan Propper, Jan 09 2008

Terms 1,2 are prepended and a(9)-a(14) are added by Max Alekseyev, Jun 29 2011; Nov 24 2017

A130421 Numbers k such that 4^k == 2 (mod k).

Original entry on oeis.org

1, 2, 14, 1022, 20066, 80519, 107663, 485918, 1284113, 1510313, 2531678, 3677198, 3933023, 4557713, 8277458, 8893262, 21122318, 24849833, 26358638, 39852014, 42448478, 71871113, 76712318, 80646143, 98058097, 104832833, 106694033, 131492498, 144322478, 146987033, 164360606, 168204191, 175126478, 176647378, 188997463, 196705598

Offset: 1

Jon E. Schoenfield, May 26 2007

nonn

Some terms above 10^15: 26435035805519327, 158975398896178078, 64044049390757098943, 1063423126446412987081943, 1091220919655042176978844783, 81074850280355100090334498663, 6317483763950169936179578094903, 5672799393875320397186007124651847, 170923900137537174138295268515194974, 195746953975871672436191077726091399305155458, 325665752547333314939363628501536024940097079718953, 953533053776414279913696071891872697927468471633033, 85791212788381063775490416118630897060666265030605503, 334519297382630382793758729321508383611586565722054114034741260213364710519401967713. - Max Alekseyev, Jun 18 2014

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

Cf. A006935 (odd terms times 2), A130422, A347906 (odd terms), A347908 (even terms).

Join[{1,2},Select[Range[107000000],PowerMod[4,#,#]==2&]] (* Harvey P. Dale, Jun 13 2013 *)

Terms a(28) onward from Max Alekseyev, Jun 18 2014

b-file corrected by Max Alekseyev, Oct 09 2016

A123061 Numbers k that divide 5^k - 3.

Original entry on oeis.org

1, 2, 22, 77, 242, 371, 16102, 45727, 73447, 81286, 112277, 368237, 10191797, 13563742, 30958697, 389974222, 6171655457, 55606837682, 401469524477, 434715808966, 1729670231597, 12399384518278, 28370781933478, 32458602019394, 45360785149757, 1073804398767214

Offset: 1

Alexander Adamchuk, Nov 04 2006

nonn

Some larger terms: 10157607413638637338691, 678641208236297002873422185407157785099272404809011007522511134591325167. - Max Alekseyev, Oct 20 2016

Cf. A050259, A130422, A277554, A116629.

Solutions to 5^n == k (mod n): A067946 (k=1), A015951 (k=-1), A124246 (k=2), A123062 (k=-2), this sequence (k=3), A123052 (k=-3), A125949 (k=4), A123047 (k=-4), A123091 (k=5), A015891 (k=-5), A277350 (k=6), A277348 (k=-6).

Select[Range[1000000], IntegerQ[(PowerMod[5,#,# ]-3)/# ]&]
Do[If[IntegerQ[(PowerMod[5, n, n ]-3)/n], Print[n]], {n, 10^9}] (* Ryan Propper, Dec 30 2006 *)

is(n)=Mod(5,n)^n==3 \\ Charles R Greathouse IV, Nov 04 2016

More terms from Farideh Firoozbakht, Nov 18 2006
Corrected and extended by Ryan Propper, Jan 01 2007
Entry revised by N. J. A. Sloane, Jan 24 2007
a(18) from Lars Blomberg, Dec 12 2011
a(19)-a(26) from Max Alekseyev, Oct 20 2016

A277554 Positive integers n such that 7^n == 3 (mod n).

Original entry on oeis.org

1, 2, 46, 2227, 6684830083, 12827743861, 151652531182, 155657642297, 3102126273955, 11006109076099, 50473807426174, 172794904196354

Offset: 1

Max Alekseyev, Oct 19 2016

No other terms below 10^15.

Cf. A066438, A277126.
Cf. Solutions to 7^n == k (mod n): A277371 (k=-3), A277370 (k=-2), A015954 (k=-1), A067947 (k=1), A277401 (k=2).
Cf. Solutions to b^n == 3 (mod n): A050259 (b=2), A130422 (b=4), A123061 (b=5), A116629 (b=13).

isok(n) = Mod(7, n)^n == 3; \\ Michel Marcus, Oct 20 2016

A327840 Numbers m that divide 4^m + 3.

Original entry on oeis.org

1, 7, 16387, 4509253, 24265177, 42673920001, 103949349763, 12939780075073

Offset: 1

Juri-Stepan Gerasimov, Sep 27 2019

Number of solutions < 10^9 to k^n == k-1 (mod n): 1 (if k = 1), 188 (if k = 2, see A006521), 5 (if k = 3, see A015973), 5 (if k = 4, see this sequence), 5 (if k = 5), 10 (if k = 6), 10 (if k = 7), 7 (if k = 8), 5 (if k = 9), 8 (if k = 10), 11 (if k = 11), 8 (if k = 12), 9 (if k = 13), 4 (if k = 14), 3 (if k = 15), 6 (if k = 16), 7 (if k = 17), 7 (if k = 18), ...

a(9) > 10^15. - Max Alekseyev, Nov 10 2022

Solutions to k^n == 1-k (mod n): A006521 (k = 2), A015973 (k = 3), this sequence (k = 4), A123047 (k = 5), A327943 (k = 6).
Solutions to 4^n == k (mod n): A000079 (k = 0), A015950 (k = -1), A014945 (k = 1), A130421 (k = 2), this sequence (k = -3), A130422 (k = 3).
Cf. A015940, A253208.

[1] cat [n: n in [1..10^8] | Modexp(4,n,n) + 3 eq n];

Select[Range[10^7], IntegerQ[(PowerMod[4, #, # ]+3)/# ]&] (* Metin Sariyar, Sep 28 2019 *)

is(n)=Mod(4,n)^n==-3 \\ Charles R Greathouse IV, Sep 29 2019

a(6)-a(7) from Giovanni Resta, Sep 29 2019

a(8) from Max Alekseyev, Nov 10 2022

cp's OEIS Frontend

A116629 Positive integers k such that 13^k == 3 (mod k).

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

PARI

Extensions

A130421 Numbers k such that 4^k == 2 (mod k).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Extensions

A123061 Numbers k that divide 5^k - 3.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

PARI

Extensions

A277554 Positive integers n such that 7^n == 3 (mod n).

Views

Author

Keywords

Comments

Crossrefs

Programs

PARI

A327840 Numbers m that divide 4^m + 3.

Views

Author

Keywords

Comments

Crossrefs

Programs

Magma

Mathematica

PARI

Extensions