23623

Properties

Appears in sequences

• Sum of digits in n-th term of A022482.at n=31A022487
• Number of partitions of n into parts not of the form 23k, 23k+9 or 23k-9. Also number of partitions with at most 8 parts of size 1 and differences between parts at distance 10 are greater than 1.at n=38A035997
• Primes at which the difference pattern X424Y (X and Y >= 6) occurs in A001223.at n=26A052166
• Smallest prime > 2n+1 beginning and ending with 2n+1, or 0 if no such prime exists.at n=11A070278
• Primes arising in A090513.at n=5A090514
• a(n) is least prime p such that 7 is the n-th term in the Euclid-Mullin sequence starting at p, or 0 if no such prime p exists.at n=30A094153
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (0, 0, 1), (1, -1, 0), (1, 1, 0)}.at n=8A150233
• Primes of the form XYX, where Y is a single digit.at n=32A154270
• a(n) = n^2 + 731*n + 1.at n=31A180919
• Primes of the form 7n^3-2.at n=4A200916
• Let p_(3,1)(m) be the m-th prime == 1(mod 3). Then a(n) is the smallest p_(3,1)(m) such that the interval(p_(3,1)(m)*n, p_(3,1)(m+1)*n) contains exactly one prime == 1(mod 3).at n=24A210465
• Lexicographically least sequence of primes (including 1) that are sum-free.at n=17A225947
• Primes of the form abcabc..abcab.at n=17A228627
• Primes having only {2, 3, 6} as digits.at n=14A260126
• Primes p such that if q is the next prime, (p+q)/6 is a triangular number.at n=38A356293
• Square array read by ascending antidiagonals: T(n,k) = [x^k] 1/(1 + x) * Legendre_P(k, (1 - x)/(1 + x))^(-n) for n >= 1, k >= 0.at n=24A364298
• a(n) = [x^n] 1/(1 + x) * Legendre_P(n, (1 - x)/(1 + x))^(-n-1) for n >= 0.at n=3A364302
• Primes having only {0, 2, 3, 6} as digits.at n=33A386043
• Primes having only {2, 3, 4, 6} as digits.at n=35A386140
• Primes having only {2, 3, 5, 6} as digits.at n=33A386144