31146661

Appears in sequences

• Carmichael numbers equal to the product of 5 primes.at n=10A112428
• Carmichael numbers of the form C = (30n-29)*(60n-59)*(90n-89)*(180n-179), where n is a natural number.at n=0A182088
• Carmichael numbers of the form C = p*(2p-1)*(3p-2)*(6p-5), where p is prime.at n=1A182518
• Carmichael numbers of the form n*(2*n - 1)*(p*n - p + 1)*(2*p*n - 2*p + 1), where p is odd, p from 3 to 23.at n=2A212882
• Carmichael numbers divisible by a smaller Carmichael number.at n=16A214758
• Carmichael numbers n such that n-1 is not a practical number.at n=9A265827
• Carmichael numbers with a record number of aliquot divisors that are also Carmichael numbers.at n=2A290497
• Carmichael numbers m such that A309132(m) < m.at n=22A309268
• Carmichael numbers k such that (k-1)/lambda(k) > (m-1)/lambda(m) for all Carmichael numbers m < k, where lambda is the Carmichael lambda function (A002322).at n=14A367320
• Carmichael numbers that are the sum of 2 positive cubes.at n=13A379656
• Array read by ascending antidiagonals: A(n,k) = (6*n + 1)*(12*n + 1)*Product_{i=0..k-2} (9*2^i*n + 1) with k >= 2.at n=30A382835
• Carmichael numbers of the form (30*k+7) * (60*k+13) * (150*k+31) * (300*k+61) * (900*k+181), k>=0, where all five factors are prime.at n=0A391076