24032

Appears in sequences

• Numbers n such that 99*2^n-1 is prime.at n=31A050575
• Triangular array generated by its row sums: T(n,0) = 1 for n >= 0, T(n,1) = r(n-1), T(n,k) = T(n,k-1) - (-1)^k * r(n-k) for k = 2, 3, ..., n, n >= 2, r(h) = sum of the numbers in row h of T.at n=53A054090
• T(n,n-1), array T as in A054090.at n=8A054093
• Triangle read by rows: T(n,k) is the number of permutations p of {1,2,...,n} such that the set {|p(i)-i|, i=1,2,...,n} has exactly k elements (1<=k<=n).at n=47A125183
• Triangle read by rows: T(n,k) is the number of 0-1-2 trees (i.e., ordered trees with all vertices of outdegree at most two) with n edges and k pairs of adjacent vertices of outdegree 2.at n=45A126218
• Triangle read by rows: coefficients of a Bessel polynomial recursion: P(x, n) = 2*(n-1)*P(x, n - 1)/x - n*P(x, n - 2) with substitution x -> 1/y.at n=31A136668
• Triangle read by rows: T(n,k) is the number of non-crossing connected graphs on n nodes on a circle in which the root (a distinguished node) has degree k (n >= 2, 1 <= k <= n-1).at n=32A143022
• Number of strings of numbers x(i=1..7) in 0..n with sum i^2*x(i)^3 equal to 49*n^3.at n=33A184322
• Number of n X 3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,2,0,1,4 for x=0,1,2,3,4.at n=5A196585
• Number of nX6 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,2,0,1,4 for x=0,1,2,3,4.at n=2A196588
• T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 3,2,0,1,4 for x=0,1,2,3,4.at n=30A196590
• T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 3,2,0,1,4 for x=0,1,2,3,4.at n=33A196590
• Number of n X 3 0..1 arrays with rows and antidiagonals unimodal and columns nondecreasing.at n=31A224141
• Number of length n+3 0..7 arrays with every four consecutive terms having the maximum of some two terms equal to the minimum of the remaining two terms.at n=3A249706
• Number of length 4+3 0..n arrays with every four consecutive terms having the maximum of some two terms equal to the minimum of the remaining two terms.at n=6A249710
• E.g.f. satisfies A(x) = 1/(1 - x * A(x)^2 * exp(x*A(x)))^2.at n=4A377547
• a(0) = 1; thereafter a(n) = 2*(6*n^2 - 3*n + 1).at n=45A386477
• Expansion of 1 / ((1-x)^2 - x^5)^2.at n=17A392553