22203

Appears in sequences

• Values of A038005 ending in 3.at n=29A038013
• p^2 + 2 where p is a prime.at n=34A061725
• Numbers m such that numerator of Sum_{k=1..m} 1/(prime(k)-k) is prime.at n=51A092065
• a(n) = 16*a(n-1) - 61*a(n-2) for n > 1; a(0) = 3, a(1) = 27.at n=4A163474
• G.f.: x/sqrt(1 + x^2 - 2*x*sqrt(1 + 4*x^2)).at n=15A201645
• Principal diagonal of the convolution array A213831.at n=17A213832
• Number of (n+2)X(4+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 5 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 5 6 or 7.at n=4A252675
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 5 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 5 6 or 7.at n=32A252679
• Number of (5+2)X(n+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 5 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 5 6 or 7.at n=3A252684
• Partial sums of A299283.at n=23A299284
• Irregular triangle read by rows. For each j, 1<=j<=n properly color the vertices of a labeled graph on [n] using each of the first j colors in the color set {c1<c2<...<cn}. Orient the edges according to the strict order on the colors. T(n,k) is the number of such directed graphs containing k descents, n>=0, 0<=k<=binomial(n,2).at n=37A381102