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!)
A297414 Numbers k such that 2^m == 2 (mod m*(m+1)), where m = A019320(k). 2

%I #14 Sep 06 2021 10:20:52

%S 1,4,9,12,25,36,40,52,80,92,124,150,208,306,361,630,656,1648,1780,

%T 2508,3300,3540,5728,6260,6450,7500,10820,12656,14076,14132,18836,

%U 20960,23456,24272,35280,43136

%N Numbers k such that 2^m == 2 (mod m*(m+1)), where m = A019320(k).

%C Also, numbers k such that A019320(k) belongs to A216822.

%o (PARI) is_A297414(k) = my(m=polcyclo(k, 2)); Mod(2, m*(m+1))^m==2;

%Y Cf. A019320, A216822, A297413, A297415.

%K nonn

%O 1,2

%A _Max Alekseyev_, Dec 29 2017

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 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)