42043

Properties

Appears in sequences

• a(n) = Sum_{j=1..n} j*prime(j).at n=31A014285
• Number of partitions of n into parts not of the form 17k, 17k+5 or 17k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 7 are greater than 1.at n=44A035966
• Primes prime(k) for which A049076(k) = 5.at n=5A049081
• Primes for which A049076 >= 4.at n=28A049090
• Primes for which A049076(p) >= 5.at n=9A049203
• Prime recurrence: a(n+1) = a(n)-th prime, with a(1) = 10.at n=5A057456
• Primes of form n.0.n+1, where '.' represents concatenation. Or, primes of form 10^(k+1)*n + n + 1, where k is the number of digits in n.at n=5A096525
• Primes arising in A073946.at n=16A113943
• Prime numbers in A014285.at n=2A114256
• Prime numbers p such that p +- ((p-1)/7) are primes.at n=22A137770
• Primes p such that the multiplicative order of 2 modulo p is (p-1)/11.at n=18A152311
• a(n) = A114537(n,n), the (n-1)-fold application of the prime function starting with the n-th nonprime.at n=5A181441
• Primes of the form 2n^2 - 7.at n=36A201714
• Centered 14-gonal (or tetradecagonal) primes.at n=18A264821
• Decimal representation of the n-th iteration of the "Rule 75" elementary cellular automaton starting with a single ON (black) cell.at n=10A266894
• Smallest prime that is the (sum, k*prime(k),k=m,..n+m-1) for some m, or 0 if no such m exists.at n=31A268467
• Numerator of the barycenter of first n primes defined as a(n) = numerator(Sum_{i=1..n} (i*prime(i)) / Sum_{i=1..n} prime(i)).at n=31A306834
• Prime numbers with prime indices in A333244.at n=6A358179
• Matula-Goebel numbers of rooted trees whose number of nodes is one more than their node-height.at n=33A358731
• Prime numbersat n=4397