438662

Appears in sequences

• Number of length n+2 0..5 arrays with every three consecutive terms having the sum of some two elements equal to twice the third.at n=17A248430
• Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) = number of subdigraphs of the transitive tournament on n nodes that have k weak components.at n=22A350609
• G.f. satisfies A(x) = 1 + x*A(x)^5*(1 + x*A(x)).at n=7A365185