30241

Properties

Appears in sequences

• Primes of the form 6*k! + 1.at n=3A062591
• Numbers k > 1 such that sigma(phi(k))/sigma(k) > sigma(phi(j))/sigma(j) for all 1 < j < k.at n=20A067573
• Primes whose digits can be arranged in increasing cyclic order - to form a substring of 123456789012345678901234567890...at n=43A068710
• Erroneous version of A092927.at n=8A087568
• Primes p such that tau(p-1)+tau(p+1) is larger than for any previous term. (Smallest prime sandwiched between more composite numbers.)at n=29A090481
• Primes of the form 1 + multiple perfect number.at n=4A093034
• Primes p such that p-1 has more divisors than any smaller prime-1.at n=21A103199
• Prime numbers arising from Schorn's proof that there are infinitely many primes.at n=13A104189
• Five-digit primes which use each of the decimal digits 0 through 4 exactly once.at n=7A109176
• Primes of the form (2*n)!/n!+1.at n=2A112856
• Primes of the form 1 + product of the first n semiprimes.at n=2A114428
• Primes for which the period of the reciprocal equals (p-1)/14.at n=24A135073
• a(n) = n-th prime arising A144717.at n=6A144718
• Primes arising in A144724.at n=5A144725
• Primes formed by rearranging five consecutive decimal digits (avoiding leading 0).at n=9A156119
• Primes of the form 1 + 4-multiperfect numbers.at n=0A171263
• a(n) = 6*n! + 1.at n=7A173314
• Triangle T(n, k) = n!*binomial(n, k) - n! + 1, read by rows.at n=34A174690
• Triangle T(n, k) = n!*binomial(n, k) - n! + 1, read by rows.at n=29A174690
• Triangle read by rows: T(n, k) = 2^n*(q^k - 1)*(q^(n - k) - 1) + 1, where q = 4.at n=17A176795