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!)
A029562 Quasi-Carmichael numbers to base -2: squarefree composites n such that for every prime p that divides n, p+2 divides n+2. 4

%I #18 May 21 2013 11:09:24

%S 598,3913,11590,32578,91078,95170,154843,179998,301273,317623,668743,

%T 1742830,1806673,2486482,2517226,4543423,5013853,5237230,6360523,

%U 6704773,7342162,8810503,10775833,12858118,16650478,18183823,19230433,21381358

%N Quasi-Carmichael numbers to base -2: squarefree composites n such that for every prime p that divides n, p+2 divides n+2.

%H Donovan Johnson and Giovanni Resta, <a href="/A029562/b029562.txt">Table of n, a(n) for n = 1..600</a> (terms < 10^12, first 200 terms from Donovan Johnson)

%H <a href="/index/Ca#Carmichael">Index entries for sequences related to Carmichael numbers.</a>

%t qcp[n_, d_] := Block[{p, e}, {p, e} = Transpose@FactorInteger@n;

%t Length[p] > 1 && Max[e] == 1 && And @@ IntegerQ /@ ((n + d)/(p + d))]; Select[Range[10^6], qcp[#, 2] &] (* _Giovanni Resta_, May 21 2013 *)

%K nonn

%O 1,1

%A _David W. Wilson_

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 24 05:40 EDT 2024. Contains 371918 sequences. (Running on oeis4.)