43201

Properties

Appears in sequences

• A variant of the cuban primes: primes p = (x^3 - y^3)/(x - y) where x = y + 2.at n=20A002648
• Primes equal to the sum of the first k primes for some k.at n=15A013918
• Lucky numbers that are the sum of the first k primes for some k.at n=16A046286
• n written efficiently in natural numbers base, i.e., in form ...wxyz where n = 1*z + 2*y + 3*x + 4*w + ... with z <= 1, y < 2, x < 3, w < 4, ...at n=38A055611
• Numbers n such that (25^n+1)/26 is a prime.at n=11A057191
• Primes with 23 as smallest positive primitive root.at n=14A061335
• Five-digit primes which use each of the decimal digits 0 through 4 exactly once.at n=15A109176
• Records in A111267.at n=26A111268
• Primes of the form 2^a * 3^b * 5^c + 1 for positive a, b, c.at n=39A114991
• a(n) = A007504(A134126(n)).at n=6A134128
• Number of n X n arrays of squares of integers with every (n-2) X (n-2) subblock summing to 5 and every element equal to at least one neighbor.at n=3A146126
• Primes formed by rearranging five consecutive decimal digits (avoiding leading 0).at n=18A156119
• a(n) = 48*n^2 + 1.at n=30A158638
• Primes whose digits can be arranged as consecutive digits (more precisely, to form a substring of 0123456789).at n=39A177119
• Primes dividing repunits R(10^n) for some n.at n=33A178070
• Primes whose digits are a permutation of (0, ..., m) for some m.at n=15A187796
• Total number of smallest parts in all partitions of n that do not contain 1 as a part.at n=44A195820
• a(n) = 1 + 2*n^2 + 3*n^3 + 4*n^4.at n=10A209262
• Number of partitions of n such that m(1) > m(3), where m = multiplicity.at n=43A240059
• Triangular array read by rows: T(n,k) is the number of pre-orders on an n-set with exactly k connected components in its digraph representation, n>=1, 1<=k<=n.at n=16A247232