116003

Appears in sequences

• Strong pseudoprimes to base 49.at n=35A020275
• Strong pseudoprimes to base 87.at n=37A020313
• Strong pseudoprimes to base 91.at n=23A020317
• Least number k such that phi(k) / Carmichael lambda(k) = 2n.at n=30A066497
• Smallest product of two distinct primes of the form n*k+1.at n=30A194265
• Number of sets of nonempty words with a total of n letters over binary alphabet containing the second letter such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=14A293883
• Decompose the multiplicative group of integers modulo N as a product of cyclic groups C_{k_1} x C_{k_2} x ... x C_{k_m}, where k_i divides k_j for i < j, then a(n) is the smallest N such that the product contains a copy of C_{2n}.at n=30A302099
• a(n) is the smallest k such that the p-rank of (Z/kZ)* is 2, where p = prime(n) and (Z/kZ)* is the multiplicative group of integers modulo n.at n=10A307434
• a(n) is the smallest k such that (Z/kZ)* contains C_(2n) X C_(2n) as a subgroup, where (Z/kZ)* is the multiplicative group of integers modulo n.at n=30A307436