44391

Appears in sequences

• Number of (k+1)-tuples of integers modulo n (x_1,...,x_k,s) such that at least one subset of the x_i sums to s mod n. In other words, n^k times the expected number of distinct subset sums mod n of k integers mod n chosen uniformly at random. Read by antidiagonals, i.e., with entries in the order (n,k)=(1,1),(1,2),(2,1),(1,3),(2,2),(3,1),...at n=50A098966
• Half the number of n X 3 binary arrays with no 1 having an adjacent 1 both above and to its left.at n=5A184755
• Half the number of n X 6 binary arrays with no 1 having an adjacent 1 both above and to its left.at n=2A184758
• T(n,k)=Half the number of nXk binary arrays with no 1 having an adjacent 1 both above and to its left.at n=30A184761
• T(n,k)=Half the number of nXk binary arrays with no 1 having an adjacent 1 both above and to its left.at n=33A184761
• a(n) = A293518(n) - A293519(n); how many more surviving even nodes than surviving (but not bifurcating) odd nodes there are at generation n in the binary tree of persistently squarefree numbers.at n=40A293517
• Number of maximal subsets of {1..n} containing n such that every pair of distinct elements has a different quotient.at n=32A325869