345240

Appears in sequences

• Triangle read by rows: T(n,k) gives number of r-bicoverings of an n-set with k blocks, n >= 2, k = 3..n+floor(n/2).at n=30A060052
• a(n) = a(n-1)+ceiling(a(n-2)/2) with a(0)=0, a(1)=1.at n=41A064323
• Consider the family of simple graphs. Sequence gives the triangle read by rows giving coefficients of polynomials arising from enumeration of those graphs on n edges.at n=40A098234
• a(n) equals the (n*(n+1)/2)-th partial sum of the self-convolution 4th power of A010054, which has the g.f.: Sum_{k>=0} x^(k*(k+1)/2).at n=32A109415
• Number of nX2 1..4 arrays containing at least one of each value, and all equal values connected.at n=7A166757
• a(n) = a(n-1) + a(n-2) - floor(a(n-2)/2), starting 2,1.at n=40A173497
• Number T(n,k) of ordered set partitions of [n] where the maximal block size equals k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=38A276922
• Number of ordered set partitions of [n] where the maximal block size equals two.at n=6A320758
• a(n) = 1 + Sum_{k=0..n-1} (1 + k^6) * a(k) * a(n-1-k).at n=4A385839