730830

Appears in sequences

• Triangle read by rows: T(n,k) is the number of weakly connected acyclic digraphs on n labeled nodes with k arcs, k=0..n*(n-1).at n=33A350909
• a(n) is the number of 4-step self avoiding walks in the n-dimensional hypercubic lattice that start at the origin.at n=14A374397