31380

Appears in sequences

• Number of n-node rooted unlabeled trees with out-degree <=2 and exactly 2 edges at the root.at n=17A036657
• Numbers n such that p(7n) is prime, where p(n) is the number of partitions of n.at n=36A114167
• Number of n X n 0..1 arrays with every nonzero element less than or equal to at least two horizontal and vertical neighbors.at n=4A202972
• Number of nX5 0..1 arrays with every nonzero element less than or equal to at least two horizontal and vertical neighbors.at n=4A202976
• T(n,k)=Number of nXk 0..1 arrays with every nonzero element less than or equal to at least two horizontal and vertical neighbors.at n=40A202979
• Number of length n+1 0..2*2 arrays with the sum of the absolute values of adjacent differences equal to n*2.at n=6A249976
• T(n,k) is the number of length n+1 0..2*k arrays with the sum of the absolute values of adjacent differences equal to n*k.at n=34A249982
• Number of length 7+1 0..2*n arrays with the sum of the absolute values of adjacent differences equal to 7*n.at n=1A249987
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 133", based on the 5-celled von Neumann neighborhood.at n=35A270234
• Table read by rows: T(n,k) = number of k-sided polygons in an equal-armed cross with arms of length n (see Comments in A331456 for definition) for k = 3,4,5,6,7.at n=41A333037
• Numbers k for which sigma(k - x) + sigma(k + x) = 8*k has at least one nonnegative solution.at n=8A384841