296564

Appears in sequences

• Expansion of e.g.f. (2 - e^x)^(-2).at n=7A005649
• Triangular array read by rows: a(n, k) = sum of number of ordered factorizations of all prime signatures with n total prime factors and k distinct prime factors.at n=34A095705
• Triangular array read by rows: a(n, k) = number of ordered factorizations of a "hook-type" number with n total prime factors and k distinct prime factors. "Hook-type" means that only one prime can have multiplicity > 1.at n=34A098348
• T(n,k) = Sum_{i=0..k} (-1)^(k-i)*binomial(k,i)*A000670(n-k+i).at n=43A122101
• a(n) is the number of ordered partitions of {1,1,2,3,...,n-1}.at n=7A172109
• Array read by antidiagonals: T(n,k) = number of barred preferential arrangements of k things with n bars (k >=0, n >= 0).at n=43A226513
• Numbers k such that c(k,0) = c(k,1), where c(k,d) = number of d's in the first k digits of the base-2 expansion of e.at n=30A293760
• Number of achiral loops (necklaces or bracelets) of length n with integer entries that cover an initial interval of positive integers.at n=14A327868
• Triangle read by rows where T(n,k) is the number of patterns of length n with k runs.at n=44A335461
• Triangle read by rows where T(n,k) is the number of length-n sequences covering an initial interval of positive integers with k maximal anti-runs.at n=37A337506
• Array read by downward antidiagonals: A(n,k) = Sum_{i=0..n-1} Sum_{j=0..k+1} binomial(n-1,i)*binomial(k+1,j)*A(i,j) with A(0,k) = 1, n >= 0, k >= 0.at n=35A383410