cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A247165 Numbers m such that m^2 + 1 divides 2^m - 1.

This page as a plain text file.
%I A247165 #52 Feb 09 2024 01:42:19
%S A247165 0,16,256,8208,65536,649800,1382400,4294967296
%N A247165 Numbers m such that m^2 + 1 divides 2^m - 1.
%C A247165 Contains 2^(2^k) = A001146(k) for k >= 2. - _Robert Israel_, Dec 02 2014
%C A247165 a(9) > 10^12. - _Hiroaki Yamanouchi_, Sep 16 2018
%C A247165 For each n, a(n)^2 + 1 belongs to A176997, and thus a(n) belongs to either A005574 or A135590. - _Max Alekseyev_, Feb 08 2024
%e A247165 0 is in this sequence because 0^2 + 1 = 1 divides 2^0 - 1 = 1.
%p A247165 select(n -> (2 &^ n - 1) mod (n^2 + 1) = 0, [$1..10^6]); # _Robert Israel_, Dec 02 2014
%t A247165 a247165[n_Integer] := Select[Range[0, n], Divisible[2^# - 1, #^2 + 1] &]; a247165[1500000] (* _Michael De Vlieger_, Nov 30 2014 *)
%o A247165 (Magma) [n: n in [1..100000] | Denominator((2^n-1)/(n^2+1)) eq 1];
%o A247165 (PARI) for(n=0,10^9,if(Mod(2,n^2+1)^n==+1,print1(n,", "))); \\ _Joerg Arndt_, Nov 30 2014
%o A247165 (Python)
%o A247165 A247165_list = [n for n in range(10**6) if n == 0 or pow(2,n,n*n+1) == 1]
%o A247165 # _Chai Wah Wu_, Dec 04 2014
%Y A247165 Cf. A247219 (n^2 - 1 divides 2^n - 1), A247220 (n^2 + 1 divides 2^n + 1).
%Y A247165 Cf. A005574, A135590, A176997.
%K A247165 nonn,more
%O A247165 1,2
%A A247165 _Juri-Stepan Gerasimov_, Nov 30 2014
%E A247165 a(8) from _Chai Wah Wu_, Dec 04 2014
%E A247165 Edited by _Jon E. Schoenfield_, Dec 06 2014