47844

Appears in sequences

• d(n,s) = number of perfect matchings on {1, 2, ..., n} with s short pairs.at n=28A079267
• Number of permutations of n copies of 1..7 introduced in order 1..7 with no element equal to another within a distance of 1.at n=1A190927
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal horizontal or antidiagonal neighbors and new values introduced sequentially from 0.at n=34A265192
• Numbers k such that (266*10^k - 17)/3 is prime.at n=29A273944
• Number of loopless linear chord diagrams with n chords.at n=7A278990
• Sum of quadratic residues of (n-th prime == 3 mod 4).at n=43A282035
• Let p = n-th prime == 3 mod 8; a(n) = sum of quadratic residues mod p.at n=21A282723
• Triangle T(n,k) read by rows: coefficients of polynomials P_n(t) defined in Formula section.at n=15A291843
• Triangle read by rows: T(n,k) = number of linear chord diagrams with n chords such that every chord has length at least k (1 <= k <= n).at n=22A293157
• Number of maximum matchings in the n-path complement graph.at n=13A302750
• A(n,k) = (1/k!) * Sum_{i_1=1..n} Sum_{i_2=1..n} ... Sum_{i_k=1..n} (-1)^(i_1 + i_2 + ... + i_k) * multinomial(i_1 + i_2 + ... + i_k; i_1, i_2, ..., i_k), square array A(n,k) read by antidiagonals, for n >= 0, k >= 0.at n=47A308356
• Square array A(n,k), n >= 1, k >= 1, read by antidiagonals, where A(n,k) is the number of permutations of n copies of 1..k introduced in order 1..k with no element equal to another within a distance of 1.at n=29A322013
• Triangle read by rows: T(n,k) is the number of perfect matchings on {1, 2, ..., 2n} with k disjoint strings of adjacent short pairs.at n=28A334059
• Triangle read by rows: T(n,k) is the total number of bubbles of size k found in linear chord diagrams on 2n vertices.at n=55A367000