58432

Appears in sequences

• Triangle read by rows: number of P-graphs by number of edges and number of non-root nodes.at n=31A011268
• Number of 2's in n-th term of A007651.at n=43A022467
• Triangle T(n, k) = 2^(k-1) * E(n, k-1) where E(n,k) are the Eulerian numbers A173018, read by rows.at n=38A142075
• T(n, k) = E(n, k)*2^k where E(n,k) are the Eulerian numbers A173018, for n > 0 and 0 <= k <= n-1, additionally T(0,0) = 1.at n=39A156365
• A symmetrical triangle: T(n,k) = A008292(n+1, k) * f(n,k), where f(n,k) = 2^k when floor(n/2) >= k, otherwise 2^(n-k).at n=38A174303
• A symmetrical triangle: T(n,k) = A008292(n+1, k) * f(n,k), where f(n,k) = 2^k when floor(n/2) >= k, otherwise 2^(n-k).at n=42A174303
• Number of permutations of length n containing exactly 2 occurrences of 123 and 2 occurrences of 132.at n=13A224288
• Number of n X 2 0..6 arrays x(i,j) with each element horizontally or vertically next to at least one element with value (x(i,j)+1) mod 7, and upper left element zero.at n=14A230529
• Chromatic invariant of the n-Fibonacci cube graph.at n=5A295927
• Triangle T(n,k) read by rows giving the coefficients of the matching-generating polynomial of the n X n knight graph (0 <= k <= floor(n^2/2)).at n=32A302241
• Numbers such that the product of their digits is equal to 10 times the sum of their prime factors, without multiplicity.at n=23A306313
• a(n) is the smallest nonnegative integer m such that the integer part of tan(m) is equal to n.at n=19A327788
• Number of nonisomorphic open quipus with n nodes.at n=21A363251