23164

Appears in sequences

• Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n and having k peaks at odd levels (0<=k<=n-2; n>=2). A hill in a Dyck path is a peak at level 1.at n=58A114586
• Number of osculating polygons of perimeter 2n on square lattice.at n=8A121345
• A polynomial of matrices is used to make a triangular sequence. The upper triangular antidiagonal Steinbach matrices are summed over their characteristic polynomial triangular sequences to give a new sequence of matrices: the characteristic polynomials of these new summed matrices are, then, used to make up this triangular sequence.at n=34A123951
• Minimal species of Latin trades of size n.at n=16A133166
• Number of (n+2) X 4 binary arrays with each 3 X 3 subblock having rows and columns in lexicographically nondecreasing order.at n=20A184541
• Central coefficients of A175105.at n=6A186268
• Triangle of coefficients of polynomials u(n,x) jointly generated with A210228; see the Formula section.at n=62A210227
• Number of length n+5 0..3 arrays with some disjoint triples in each consecutive six terms having the same sum.at n=4A248063
• T(n,k)=Number of length n+5 0..k arrays with some disjoint triples in each consecutive six terms having the same sum.at n=25A248068
• Number of length 5+5 0..n arrays with some disjoint triples in each consecutive six terms having the same sum.at n=2A248073
• a(n) = A186434(n)/4.at n=15A271908
• Numbers k such that 4*10^k + 91 is prime.at n=19A295030
• a(n) is the number of composites k such that radical(k) = sopfr(k) = A350352(n).at n=44A391501