|
Search: id:A141703
|
|
|
| A141703 |
|
a(n) = number of Carmichael numbers of the form prime(n)*prime(n')*prime(n") with n < n' < n". |
|
+0
3
|
|
| 0, 1, 3, 6, 0, 5, 2, 2, 1, 2, 7, 5, 7, 11, 3, 3, 1, 10, 3, 7, 4, 1, 2, 5, 6, 2, 5, 3, 10, 5, 5, 11, 4, 6, 2, 9, 11, 7, 2, 3, 4, 11, 6, 10, 0, 7, 17, 5, 4, 6, 1, 5, 10, 7, 5, 4, 4, 14, 8, 9, 2, 5, 12, 9, 16, 2, 16, 15, 2, 6, 5, 2, 9, 8, 8, 3, 1, 7, 13, 7, 3, 13, 5, 14, 6, 8, 4, 9, 6, 4, 1, 1, 9, 7, 3, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
It is known that there is a finite number of Carmichael numbers with k prime factors if k-2 of the factors are fixed. Here we consider the case k=3 and impose the additional condition that prime(n) be the smallest of the 3 factors.
The primes related to the zeros in this sequence are in A051663. - J. Brennen (jb(AT)brennen.net), Jul 01 2008
|
|
LINKS
|
M. F. Hasler, Table of n, a(n) for n=1,...,5000.
Index entries related to Carmichael numbers.
|
|
FORMULA
|
a(n) = # { pqr | p=prime(n) < q=prime(n') < r=prime(n") ; p-1 | pqr-1 ; q-1 | pqr-1 ; r-1 | pqr-1 }
|
|
EXAMPLE
|
a(1)=0 since prime(1)=2 and there is no even Carmichael number.
a(2)=1 since prime(2)=3 and 561 is the only Carmichael number of the form 3pq with p,q prime.
a(3)=3 since prime(3)=5 and the only Carmichael numbers of the form 5pq are {1105, 2465, 10585}.
|
|
PROGRAM
|
(PARI) A141703(n, verbose=0) = { /* based on code by J.Brennen (jb AT brennen.net) */ local( V=[], B, p=prime(n), q, r); for( A=1, p-1, B=ceil((p^2+1)/A); while( 1, r=(p*B-p+A*B-B)/(A*B-p*p); q=(A*r-A+1)/p; q<=p && break; denominator(q)==1 && denominator(r)==1 && r>q && isprime(q) && isprime(r) && (p*q*r)%(p-1)==1 && V=concat(V, [p*q*r]); B++ )); verbose && print1(V); #V }
|
|
CROSSREFS
|
Cf. A002997 and references therein ; A087788 ; A141702 ff.
Sequence in context: A113565 A038023 A008954 this_sequence A021739 A010470 A077590
Adjacent sequences: A141700 A141701 A141702 this_sequence A141704 A141705 A141706
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
M. F. Hasler (Maximilian.Hasler(AT)gmail.com), Jul 01 2008
|
|
|
Search completed in 0.002 seconds
|
