55441

Properties

Appears in sequences

• Primes with record values of the least positive primitive root.at n=11A002230
• Smallest prime having least positive primitive root n, or 0 if no such prime exists.at n=37A023048
• Numbers whose least quadratic nonresidue (A020649) is 19.at n=21A025027
• Primes with 38 as smallest positive primitive root.at n=0A061740
• Numbers k > 1 such that sigma(phi(k))/sigma(k) > sigma(phi(j))/sigma(j) for all 1 < j < k.at n=21A067573
• Smallest prime == 1 mod L, where L = LCM of 1 to n.at n=11A070858
• Smallest prime == 1 mod L, where L = LCM of 1 to n.at n=10A070858
• Primes p such that p-1 is a highly composite number.at n=14A072826
• Group the natural numbers so that the product of the terms in each group + 1 is a prime: (1), (2), (3, 4), (5, 6), (7, 8, 9, 10, 11), (12), (13, 14, 15), (16), ... This is the sequence of such primes.at n=4A073688
• Smallest prime == 1 mod first n composite numbers.at n=12A075063
• Smallest prime == 1 mod first n composite numbers.at n=13A075063
• Let p = n-th prime, then a(n) = smallest prime having p as its least prime primitive root.at n=16A084739
• a(n) = smallest prime of the form n*(n+1)*(n+2)*...*(n+k) + 1, or 0 if no such prime exists.at n=6A087564
• Smallest prime of the form n*(n+1)*(n+2)...(n+k) + 1, k > 0, i.e., a(n) > n+1, or 0 if no such prime exists.at n=6A089305
• Primes p such that p-1 has more divisors than any smaller prime-1.at n=23A103199
• a(0) = 1, a(1) = 9, a(n) = 6*a(n-1) - a(n-2) - 4.at n=6A114040
• Primes with record large values of the second smallest positive primitive root.at n=17A124111
• Let m = n-th number that is not a perfect power, A007916(n). Then a(n) = smallest prime having least positive primitive root m.at n=28A133432
• Records in A084739.at n=8A133434
• Highly composite numbers + 1.at n=27A135372