31271

Properties

Appears in sequences

• Take A000040, omit commas: 23571113171923..., select 5-digit primes seen when scanning from left.at n=12A073038
• 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=30A133781
• Primes p such that p^3 - 12 and p^3 + 12 are also primes.at n=32A153322
• Smallest primes p = p(k) with (p(k)+p(k+1)+p(k+2))/15 an integer.at n=31A168556
• Triangle T(n,k) = A008292(n+1,k+1) + A176487(n,k) - 1, 0<=k<=n.at n=31A176488
• Triangle T(n,k) = A008292(n+1,k+1) + A176487(n,k) - 1, 0<=k<=n.at n=32A176488
• Quadruple Hex-primes: let f(n) = A102489(n); then sequence lists primes p such that f(p), f(f(p)). f(f(f(p))) and f(f(f(f(p)))) are also primes.at n=21A237440
• Primes p such that f(f(p)) is prime, where f(x) = x^4 + x^3 + x^2 + x + 1 = A053699(x).at n=33A237445
• Absolute discriminants of complex quadratic fields with 3-class group of type (3,3) and Hilbert 3-class field tower of exact length 3, except for the cases mentioned in the COMMENTS.at n=12A242878
• Prime numbers p such that p^3 is an interprime = average of two successive primes.at n=40A248799
• Number of n X 3 0..1 arrays with the number of 1's horizontally, antidiagonally or vertically adjacent to some 0 two less than the number of 0's adjacent to some 1.at n=5A289646
• Number of n X 6 0..1 arrays with the number of 1's horizontally, antidiagonally or vertically adjacent to some 0 two less than the number of 0's adjacent to some 1.at n=2A289649
• T(n,k) = Number of n X k 0..1 arrays with the number of 1's horizontally, antidiagonally or vertically adjacent to some 0 two less than the number of 0's adjacent to some 1.at n=30A289651
• T(n,k) = Number of n X k 0..1 arrays with the number of 1's horizontally, antidiagonally or vertically adjacent to some 0 two less than the number of 0's adjacent to some 1.at n=33A289651
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1), where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=18A294541
• Concatenate the terms of A027750 (omitting spaces and commas), chop into blocks of length 5, then omit any leading zeros.at n=8A362446
• Triangle read by rows: T(n,k) = number of connected quartic graphs on n vertices with crossing number k for n >= 1, k >= 0.at n=53A390644
• Prime numbersat n=3372