23567
domain: N
Properties
Primality
- Prime
- yes
Appears in sequences
- Primes of the form k^2 + k + 5.at n=39A027755
- Primes congruent to 3 modulo 4 generated recursively: a(n) = Min_{p, prime; p mod 4 = 3; p|4Q-1}, where Q is the product of all previous terms in the sequence. The initial term is 3.at n=22A057205
- Polynomial (1/3)*n^3 + (9/2)*n^2 + (85/6)*n - 2.at n=37A073775
- Primes that are a concatenation of 2, 3, 5 and a prime.at n=4A101251
- Let p = prime(sigma(n)) and q = prime(phi(n)), then p is in the sequence if p-q = 6.at n=29A103176
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having k primitive Dyck factors (n >= 0; 0 <= k <= n).at n=57A129154
- Prime numbers p for which the quintic polynomial x^5 - x - 1 modulo p completely factors into linear polynomials.at n=17A135844
- Prime numbers p not of the form 10*k+1 for which the quintic polynomial x^5-x-1 modulus p is factorizable into five binomials.at n=13A135845
- Primes congruent to 26 mod 59.at n=38A142753
- Concatenation of the first n terms of A144338.at n=4A159902
- a(n) = 81*n^2 - 2247*n + 15383.at n=31A182255
- Primes remaining primes under map 3<=>5 (interchange of decimal digits 3 and 5).at n=36A198047
- Numbers m such that m, m-1, m-2 and m-3 are 1,2,3,4-almost primes respectively.at n=33A201220
- Primes p of the form p = prime(n) + prime(n+1) - 5 and p = prime(k) + prime(k+1) + 5.at n=41A207992
- Number of n X 3 0..1 arrays with rows, diagonals and antidiagonals unimodal and columns nondecreasing.at n=31A223833
- Primes p which are floor of Root-Mean-Cube (RMC) of prime(n) and prime(n+1).at n=18A240339
- Number of composite Lucas numbers between the prime Lucas numbers A005479(n) and A005479(n+1).at n=48A245472
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 379", based on the 5-celled von Neumann neighborhood.at n=32A271537
- Concatenation of the first n nonsquares (A000037).at n=4A283560
- a(n) = Sum_{k=1..n} k^2*phi(k), where phi is the Euler totient function A000010.at n=18A319087