19763

Properties

Appears in sequences

• Least prime in A031932 (lesser of 14-twins) whose distance to the next 14-twin is 6*n.at n=36A052356
• a(n) = r-th prime of the form (p-q)/(q-r) with r=prime(n+1), q=prime(n+2), and primes p > q.at n=62A089577
• Number of partitions of n into Fibonacci number of integer parts.at n=46A102848
• Primes that are not the sum of 3 hexagonal numbers.at n=72A117089
• Number of permutations in S_n avoiding 5234{bar 1} (i.e., every occurrence of 5234 is contained in an occurrence of a 52341).at n=8A137546
• An example of a simple prime-generating algorithm similar to Rowland's (A106108) that is a particular instance of a more general algorithm (see comments).at n=45A141537
• Primes congruent to 57 mod 59.at n=37A142784
• Primes congruent to 60 mod 61.at n=32A142858
• a(n) = (n^3 - n + 9)/3.at n=38A155753
• Primes of the form n^3 + 3*n - 1.at n=6A180276
• Number of n X 2 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,2,1,1,1 for x=0,1,2,3,4.at n=14A197539
• Primes of the form 9n^3-10.at n=3A201035
• Pairs of consecutive primes {p,q} for which the numbers of distinct residues of all factorials mod p and mod q coincide.at n=31A210242
• Number of 3 X n arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 3 X n array.at n=11A219884
• Primes of the form 3^k + 3^m - 1, where k and m are positive integers.at n=21A234346
• Primes of the form m = 3^i + 3^j - 1, where i > j >= 0.at n=17A239713
• Primes of the form 3^x + y^3 with x, y >0.at n=31A250716
• Concatenation of n-th prime and n-th nonprime.at n=44A253910
• Primes of the form 10n^2 - 90n + 163.at n=26A256376
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 630", based on the 5-celled von Neumann neighborhood.at n=34A269543