24045

Appears in sequences

• a(n) = T(n,n-6), array T as in A055818.at n=9A055823
• 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=34A184322
• Number of (n+1)X3 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock the same.at n=2A205903
• Number of (n+1)X4 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock the same.at n=1A205904
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock the same.at n=7A205909
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock the same.at n=8A205909
• Triangular array read by rows. T(n,k) is the number of labeled bipartite graphs on n nodes having exactly k connected components; n>=1, 1<=k<=n.at n=31A228859
• Number of n X 3 nonnegative integer arrays with upper left 0 and lower right its king-move distance away minus 2 and every value within 2 of its king move distance from the upper left and every value increasing by 0 or 1 with every step right, diagonally se or down.at n=27A253218
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 193", based on the 5-celled von Neumann neighborhood.at n=34A270687
• Numbers n such that 6^n-5^(n+1) is prime.at n=15A272781
• Triangle read by rows: T(n,k) = number of homeomorphically irreducible connected labeled graphs with n edges and k vertices, n >= 0, 1 <= k <= n+1.at n=61A331437
• Irregular triangle read by rows: T(n,k) = number of homeomorphically irreducible connected labeled graphs with n vertices and k edges, n >= 1, 0 <= k <= n*(n-1)/2.at n=51A331438
• Number of integer partitions of n that can be partitioned into distinct pairs of distinct parts, i.e., into a set of edges.at n=47A339560