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.
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!)
A217465 Composite integers k such that 2^k == 2 (mod k*(k+1)). 6
561, 1905, 4033, 4681, 5461, 6601, 8481, 11305, 13741, 13981, 16705, 23377, 30121, 31417, 41041, 49141, 52633, 57421, 88357, 88561, 101101, 107185, 121465, 130561, 162193, 196021, 196093, 204001, 208465, 219781, 266305, 276013, 278545, 282133, 285541, 314821, 334153, 341497, 390937, 399001 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Terms A019320(k) belongs to this sequence for k in A297415. - Max Alekseyev, Dec 29 2017
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..12766 (terms below 10^12; terms 1..100 from Harvey P. Dale)
Mersenne Forum, Prime Conjecture, 2012.
MATHEMATICA
Select[Range[400000], !PrimeQ[#]&&PowerMod[2, #, #(#+1)]==2&] (* Harvey P. Dale, Oct 12 2012 *)
PROG
(PARI) for(n=1, 10000, if((2^n)%(n*(n+1))==2&&isprime(n)==0, printf(n", ")))
(Python)
from sympy import isprime
A217465_list = [n for n in range(1, 10**6) if pow(2, n, n*(n+1)) == 2 and not isprime(n)] # Chai Wah Wu, Mar 25 2021
CROSSREFS
Subsequence of A216822.
Contains A303531 as a subsequence.
Sequence in context: A083732 A292367 A290805 * A097130 A110889 A205947
KEYWORD
nonn
AUTHOR
V. Raman, Oct 04 2012
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 15 08:34 EDT 2024. Contains 372538 sequences. (Running on oeis4.)