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!)
A064238 Values of m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,3. 14

%I #29 Jun 25 2023 18:06:48

%S 6,36,210,270,306,330,336,600,726,1170,1236,1296,1530,1656,2220,2280,

%T 2556,3036,3060,3066,4260,4446,4800,4950,5226,5580,5850,6150,6360,

%U 6690,6840,6966,7620,7680,7686,7866,8016,8166,8190,8286,8520,8526,8646,8940,9090

%N Values of m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,3.

%C am+1, bm+1, cm+1 are primes and am | (N-1), bm | (N-1), cm |(N-1).

%C All m's are multiples of 6 and m, 2m and 3m divide m(2m+1)(3m+1)-1 automatically.

%D Harvey Dubner (harvey(AT)dubner.com), personal communication, Jun 27 2001.

%H Amiram Eldar, <a href="/A064238/b064238.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = 6 * A046025(n).

%p q:= n-> andmap(isprime, [6*j*n+1$j=1..3]):

%p map(x-> 6*x, select(q, [$1..2000]))[]; # _Alois P. Heinz_, Jun 25 2023

%t CarmichaelNbrQ[n_] := ! PrimeQ@ n && Mod[n, CarmichaelLambda[n]] == 1; Select[ Range@ 9000, PrimeQ[# + 1] && PrimeQ[2# + 1] && PrimeQ[3# + 1] && CarmichaelNbrQ[(# + 1)(2 # + 1)(3 # + 1)] &] (* _Robert G. Wilson v_, Aug 23 2012 *)

%Y Cf. A046025, A087788.

%K nonn

%O 1,1

%A _N. J. A. Sloane_, Sep 23 2001

%E Offset corrected by _Amiram Eldar_, Oct 16 2019

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 8 13:24 EDT 2024. Contains 372333 sequences. (Running on oeis4.)