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!)
A182132 Carmichael numbers of the form C = (30n-7)*(90n-23)*(300n-79). 1
340561, 4335241, 153927961, 542497201, 1678569121, 2598933481, 3164207761, 25923026641, 63280622521, 88183003921, 155999871721, 209850699601, 240893092441, 274855097881, 380692027321, 733547013841, 1688729866321 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Note that in this sequence, 30n-7, 90n-23, and 300n-79 do not have to be prime.
Conjecture: The number C = (30n-7)*(90n-23)*(300n-79) is a Carmichael number if (but not only if) 30n-7, 90n-23 and 300n-79 are all three prime numbers.
The conjecture is checked for 0<n<130; we got Carmichael numbers with three prime divisors for n = 2, 9, 15, 32, 43, 48, 58, 64, 67, 78, 97, 128.
We got Carmichael numbers with more than three prime divisors for n = 1, 6, 13, 70.
Note that if n is 5 mod 7 then 90n-23 and 300n-79 are both multiples of 7 and hence C is not a Carmichael number. Otherwise, the three factors are relatively prime. - Charles R Greathouse IV, Jun 29 2017
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
PROG
(PARI) list(lim)=my(v=List(), C, n); while(n++ && (C=(30*n-7)*(90*n-23)*(300*n-79))<=lim, if(n%7==5, next); my(f1=factor(30*n-7), f2=factor(90*n-23), f3=factor(300*n-79), t); if(vecmax(f1[, 2])>1 || vecmax(f2[, 2])>1 || vecmax(f3[, 2])>1, next); t=concat(concat(f1[, 1], f2[, 1]), f3[, 1]); for(i=1, #t, if((C-1)%(t[i]-1), next(2))); listput(v, C)); Vec(v) \\ Charles R Greathouse IV, Jun 29 2017
CROSSREFS
Cf. A002997 (Carmichael numbers).
Sequence in context: A236609 A103808 A251996 * A182515 A236703 A178900
KEYWORD
nonn
AUTHOR
Marius Coman, Apr 14 2012
EXTENSIONS
a(7) inserted by Charles R Greathouse IV, Jun 29 2017
STATUS
approved

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 July 18 21:02 EDT 2024. Contains 374388 sequences. (Running on oeis4.)