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!)
A206023 2^n == 3n+2 (mod n^2-2n) 1

%I #7 Mar 30 2012 18:35:45

%S 3,5,7,13,19,31,43,61,73,103,109,139,151,181,193,199,229,241,271,283,

%T 313,349,421,433,463,523,563,571,601,619,643,645,647,661,811,823,829,

%U 859,883,1021,1033,1051,1063,1093,1105,1153,1231,1279,1291,1303,1321,1429

%N 2^n == 3n+2 (mod n^2-2n)

%C Consists of n such that each of n and n-2 are either prime (A000040) or Sarrus pseudoprimes (A001567).

%C Includes the upper twin primes (A006512).

%H David W. Wilson, <a href="/A206023/b206023.txt">Table of n, a(n) for n = 1..10000</a>

%K nonn

%O 1,1

%A _David W. Wilson_, Feb 02 2012

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 4 21:32 EDT 2024. Contains 372257 sequences. (Running on oeis4.)