login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A207041 Carmichael numbers that can be written as a product of two Carmichael numbers. 3
509033161, 1836304561, 5394826801, 20064165121, 25594002721, 47782272385, 59970791881, 75527369281, 84127131361, 96578912521, 116087568961, 278585544601, 387394248241, 416937760921, 584698468861, 1623222276481, 1690000282321, 1788750684721, 1945024664401 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Subsequence of A002997; a(1) = A002997(472) and a(9) = A002997(3380).

LINKS

Donovan Johnson and Charles R Greathouse IV, Table of n, a(n) for n = 1..5308 (terms < 2^64; indices 1..2008, representing terms < 10^18, are from Johnson)

Richard Pinch, Carmichael numbers < 10^18

EXAMPLE

a(1) = 509033161 = 1729 * 294409 = A002997(3) * A002997(25).

a(9) = 84127131361 = 15841 * 5310721 = A002997(9) * A002997(78) = 172081 * 488881 = A002997(21) * A002997(32) (two representations).

MATHEMATICA

(*M is the set of the first G (G<=10000) Carmichael numbers, as found in https://oeis.org/A002997/b002997.txt*) i=0; SPCM={}; While[i<G-1, i++; m=M[[i]]; j=i; While[j<G, j++; n=M[[j]]; If[GCD[m, n]==1, c=m n; If[c<=M[[1]] M[[G]], Fc=FactorInteger[c]; k=Length[Fc]; j2=0; While[j2<k, j2++; p=First[Fc[[j2]]]; If[Mod[c-1, p-1]!=0, j2=k+1]]; If[j2!=k+1, SPCM=Append[SPCM, c]]]]]]; SPCM=Union[SPCM]

CROSSREFS

Cf. A002997.

Sequence in context: A234063 A210155 A203261 * A339551 A319937 A186092

Adjacent sequences:  A207038 A207039 A207040 * A207042 A207043 A207044

KEYWORD

nonn

AUTHOR

Emmanuel Vantieghem, Feb 14 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 24 05:38 EDT 2021. Contains 348217 sequences. (Running on oeis4.)