The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A247220 Numbers k such that k^2 + 1 divides 2^k + 1. 6
 0, 2, 4, 386, 20136, 59140, 373164544 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(8) > 10^12. - Giovanni Resta, May 05 2020 All terms of the sequence are even. a(5), a(6) and a(7) are of the form 2*p + 2 where p is a prime and mod(p, 14) = 1. - Farideh Firoozbakht, Dec 07 2014 From Jianing Song, Jan 13 2019: (Start) Among the known terms only a(3) and a(4) are of the form 2*p where p is a prime. a(n)^2 + 1 is prime for 2 <= n <= 7. Among these primes, the multiplicative order of 2 modulo a(n)^2 + 1 is 2*a(n) except for n = 5, in which case it is 2*a(n)/3. (End) If a(n)^2 + 1 is composite, then a(n) is also a term of A135590. - Max Alekseyev, Apr 25 2024 LINKS Table of n, a(n) for n=1..7. EXAMPLE 0 is in this sequence because 0^2 + 1 = 1 divides 2^0 + 1 = 2. PROG (PARI) for(n=0, 10^5, if(Mod(2, n^2+1)^n==-1, print1(n, ", "))); \\ Joerg Arndt, Nov 30 2014 (Python) from gmpy2 import powmod A247220_list = [i for i in range(10**7) if powmod(2, i, i*i+1) == i*i] # Chai Wah Wu, Dec 03 2014 CROSSREFS Cf. A135590, A247165. Sequence in context: A012562 A263959 A216024 * A012753 A012440 A058172 Adjacent sequences: A247217 A247218 A247219 * A247221 A247222 A247223 KEYWORD nonn,more AUTHOR Juri-Stepan Gerasimov, Nov 26 2014 EXTENSIONS a(7) from Hiroaki Yamanouchi, Nov 29 2014 STATUS approved

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.

Last modified May 29 11:28 EDT 2024. Contains 372940 sequences. (Running on oeis4.)