4670029

Appears in sequences

• Numbers n such that n*(n-1) is an oblong (promic, A002378) palindrome.at n=15A056794
• Pseudoprimes (base-2) equal to the product of 5 primes not necessarily distinct.at n=9A112443
• a(n) = A027762(n)/A165734(n).at n=35A165949
• Poulet numbers (Fermat pseudoprimes to base 2) with a record number of divisors that are also Poulet numbers.at n=5A300327
• Base-2 Fermat pseudoprimes k such that (k-1)/ord(2, k) > (m-1)/ord(2, m) for all base-2 Fermat pseudoprimes m < k, where ord(2, k) is the multiplicative order of 2 modulo k.at n=25A367319
• 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=13A382835