50814
domain: N
Appears in sequences
- Triangle read by rows: T(n,k) (n>=2, k=0..n-1) gives number of biconnected graphs on n nodes with chromatic number n-k.at n=34A126749
- Number of biconnected graphs on n nodes with chromatic number 3.at n=8A126751
- Number of length n+2 0..n arrays with no three unequal elements in a row and no three equal elements in a row and new values 0..n introduced in 0..n order.at n=12A243721
- Number of length n+2 0..7 arrays with no three unequal elements in a row and no three equal elements in a row and new values 0..7 introduced in 0..7 order.at n=12A243726
- Number of length n+2 0..8 arrays with no three unequal elements in a row and no three equal elements in a row and new values 0..8 introduced in 0..8 order.at n=12A243727
- Number of length n+2 0..9 arrays with no three unequal elements in a row and no three equal elements in a row and new values 0..9 introduced in 0..9 order.at n=12A243728
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 361", based on the 5-celled von Neumann neighborhood.at n=42A271416
- Number of ways to choose a strict partition of each part of a strict composition of n.at n=19A336343