|
%I #27 Feb 26 2022 16:33:44
%S 1,137243,2517961,117741349,369940993,19049924867,30861256333,
%T 1087115897989,38969560049629
%N Numbers k such that 4^k == 3 (mod k).
%C No other terms below 10^15.
%C 222775558403218644781528238995676668723498240827403019 belongs to this sequence. - _Max Alekseyev_, Jul 03 2014
%H M. Miller, <a href="http://ajc.maths.uq.edu.au/pdf/3/ajc-v3-p151.pdf">Digraph covering and its application to two optimization problems for digraphs</a>, Australasian Journal of Combinatorics, 3 (1991), pp. 151-164.
%o (PARI) for (n=1,10^33, if ( Mod(4,n)^n==3, print1(n,", "))); /* _Joerg Arndt_, Jun 09 2012 */
%Y Cf. A130421.
%K nonn,more
%O 1,2
%A _Jon E. Schoenfield_, May 26 2007
%E a(6) from _Jon E. Schoenfield_, Sep 30 2013
%E a(7) from _Jared Polzer_, Oct 03 2013
%E a(8)-a(9) from _Max Alekseyev_, Jul 03 2014
|
