login

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”).

A130422
Numbers k such that 4^k == 3 (mod k).
5
1, 137243, 2517961, 117741349, 369940993, 19049924867, 30861256333, 1087115897989, 38969560049629
OFFSET
1,2
COMMENTS
No other terms below 10^15.
222775558403218644781528238995676668723498240827403019 belongs to this sequence. - Max Alekseyev, Jul 03 2014
LINKS
M. Miller, Digraph covering and its application to two optimization problems for digraphs, Australasian Journal of Combinatorics, 3 (1991), pp. 151-164.
PROG
(PARI) for (n=1, 10^33, if ( Mod(4, n)^n==3, print1(n, ", "))); /* Joerg Arndt, Jun 09 2012 */
CROSSREFS
Cf. A130421.
Sequence in context: A253981 A191819 A015071 * A022235 A234225 A110598
KEYWORD
nonn,more
AUTHOR
Jon E. Schoenfield, May 26 2007
EXTENSIONS
a(6) from Jon E. Schoenfield, Sep 30 2013
a(7) from Jared Polzer, Oct 03 2013
a(8)-a(9) from Max Alekseyev, Jul 03 2014
STATUS
approved