23671

Properties

Appears in sequences

• a(n) = [ 3rd elementary symmetric function of {log(k)} ], k = 2,3,...,n.at n=20A025203
• Indices of primes in sequence defined by A(0) = 11, A(n) = 10*A(n-1) + 81 for n > 0.at n=9A056250
• Prime lucky numbers k (from A031157) such that nextprime(k)=nextlucky(k).at n=30A057698
• Smallest balanced prime of order n.at n=38A082080
• Odd primes which can never divide 2^a+2^b+1.at n=33A179113
• Primes with eight embedded primes.at n=19A179916
• Number of partitions p of n such that (number of even numbers in p) = (number of odd numbers in p).at n=46A241638
• Least prime p such that pi(p*n) = prime(q*n) for some prime q, where pi(x) denotes the number of primes not exceeding x.at n=57A260197
• a(n) = n^3 + 2*n^2 + 5*n + 11.at n=28A271779
• Primes of the form n^3 + 2n^2 + 5n + 11.at n=18A271840
• Lucky primes k such that k+6 is also a lucky prime.at n=33A309381
• Primes p such that q^2 - p^2 + 1 is the square of a composite number where p and q are consecutive primes.at n=25A316934
• a(n) is the number of unlabeled unrooted trees (as in A000055) on n nodes with one designated node (exclusive) or one designated edge.at n=13A328779
• Primes in A343531.at n=15A343532
• Number of compositions (ordered partitions) of n into at most 5 prime powers (including 1).at n=45A347775
• Smallest prime p such that the multiplicative order of 16 modulo p is 2*n, or 0 if no such prime exists.at n=44A372800
• a(n) is the least prime p such that p + 8*k*(k+1) is prime for 0 <= k <= n-1 but not for k=n.at n=6A378839
• Prime numbersat n=2634