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!)
A065703 Values of m such that N = (m+1)(2m+1)(71m+1) is a 3-Carmichael number (A087788). 10

%I #15 Oct 17 2019 16:40:34

%S 1170,5430,53568,59106,63366,86370,95316,99576,103836,105966,116190,

%T 183498,184776,239730,260178,300648,319818,333450,339840,362418,

%U 367530,481698,485958,503850,511518,605238,644856,725370,732186,762006,788418,799920,837408,870210

%N Values of m such that N = (m+1)(2m+1)(71m+1) is a 3-Carmichael number (A087788).

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

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

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

%o (PARI) for(m=1,1e6,is_A002997((m+1)*(2*m+1)*(71*m+1)) & print1(m",")) \\ - _M. F. Hasler_, Aug 23 2012

%Y Cf. A064238-A064262, A065695, A065696, A065697, A065698, A065699, A065700, A065701, A065702, A087788.

%K nonn

%O 1,1

%A Harvey Dubner (harvey(AT)dubner.com), Nov 14 2001

%E Definition simplified, missing terms inserted, and extended by _M. F. Hasler_, Aug 23 2012

%E More terms from _Amiram Eldar_, Oct 17 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 March 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)