19326

Appears in sequences

• Values of m, the main key or generating number for Pythagorean triangles in which S (the odd short leg) and U (the hypotenuse) are twin primes.at n=40A051891
• a(n) = ((6+sqrt(5))^n+(6-sqrt(5))^n)/2.at n=5A152107
• Triangle read by rows:e(n,k)=Sum[(-1)^j Binomial[n + 1, j](k + 1 - j)^n, {j, 0, k + 1}]; t(n,m)=(e[n + 1, m]*PartitionsQ[n] + e[n + 1, n - m]*(PartitionsQ[ n - m] + PartitionsQ[m])) - 2.at n=24A156225
• a(1) = 2, a(2) = 3; thereafter a(n) = a(n-1) + a(|n-a(T)|), where a(T) is the largest term in the sequence before a(n) such that 0 < |n-a(T)| < n.at n=37A271063
• Numbers k such that (292*10^k - 1)/3 is prime.at n=23A281407
• Number of nX3 0..2 arrays with no element equal to more than one of its horizontal, diagonal or antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=3A281690
• T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its horizontal, diagonal or antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=18A281693
• Number of 4Xn 0..2 arrays with no element equal to more than one of its horizontal, diagonal or antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=2A281696
• One-half of the number of closed binary words of length n that are not privileged.at n=19A297185
• Expansion of 1/(2 - Product_{k>=1} (1 + k*x^k)).at n=10A307063