31139

Properties

Appears in sequences

• a(1) = 2; a(n) is the smallest prime greater than the sum of all previous terms.at n=14A070218
• Safe primes (A005385) (p and (p-1)/2 are primes) such that 12*p+1 is also prime.at n=60A075707
• Primes p such that p's set of distinct digits is {1,3,9}.at n=37A108383
• Prime sequence overlaying the central digits of prime numbers. If possible, the value is greater than the previous one. Zero if no such embedding is possible.at n=29A133781
• Number of ways to place 3 nonattacking nightriders on a 3 X n board.at n=20A172218
• Primes p such that 3*p+2, 5*p+4 and 7*p+6 are also prime.at n=33A173876
• Emirps whose internal digits are also an emirp.at n=29A225235
• The number of n-digit numbers in A264847 (pluritriangular numbers).at n=10A265108
• Number of subsets of {1..n} whose mean is an integer, where {} has mean 0.at n=18A327475
• Primes p such that exactly four numbers among all circular permutations of the digits of p are prime.at n=27A344628
• Number of semi-sums of strict integer partitions of n.at n=48A366741
• Prime numbers p such that the product of their prime digits is equal to the product of their nonprime digits, where p has at least one prime digit.at n=20A369877
• Primes p such that p + 8, p + 12 and p + 20 are also primes.at n=35A384299
• The smallest k >= 0 that can be represented as a linear combination of 1^2, 2^2, ..., n^2 with coefficients +-1 and that cannot be represented using 1^2, 2^2, ..., m^2 with 1<=m<n.at n=45A392127
• Prime numbersat n=3353