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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A015950 Numbers k such that k | 4^k + 1. 18

%I #57 Sep 08 2022 08:44:40

%S 1,5,25,125,205,625,1025,2525,3125,5125,8405,12625,15625,25625,42025,

%T 63125,78125,103525,128125,168305,202525,210125,255025,315625,344605,

%U 390625,517625,640625,841525,875125,1012625,1050625,1275125

%N Numbers k such that k | 4^k + 1.

%C From _Robert Israel_, Sep 14 2017: (Start)

%C All terms except 1 are congruent to 5 mod 20.

%C If k is a term and prime p | k, then k*p is a term.

%C All prime factors of terms == 1 (mod 4).

%C If p is a prime == 1 (mod 4) and the order of 4 (mod p) is 2*m where m is in the sequence, then m*p is in the sequence. (End)

%H Max Alekseyev, <a href="/A015950/b015950.txt">Table of n, a(n) for n = 1..3514</a> (first 325 terms from Robert Israel)

%e 4^5 + 1 = 1025 and 1025 is divisible by 5, so 5 is a term.

%p select(n -> 4 &^ n + 1 mod n = 0, [1, seq(i,i=5..10^7,20)]); # _Robert Israel_, Sep 14 2017

%t Select[Prepend[20 Range[0, 10^5] + 5, 1], Mod[4^# + 1, #] == 0 &] (* _Michael De Vlieger_, Dec 31 2018 *)

%o (PARI) is_A015950(n) = Mod(4,n)^n == -1; \\ _Michel Marcus_, Sep 15 2017

%o (Magma) [n: n in [1..10^6] | Modexp(4, n, n)+1 eq n]; // _Jinyuan Wang_, Dec 29 2018

%o (Python)

%o A015950_list = [n for n in range(1,10**6) if pow(4,n,n) == n-1] # _Chai Wah Wu_, Mar 25 2021

%Y Cf. A015945, A211349.

%Y Column k=4 of A333429.

%K nonn

%O 1,2

%A _Robert G. Wilson v_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 16:21 EDT 2024. Contains 371794 sequences. (Running on oeis4.)