45297

Appears in sequences

• Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'.at n=60A100862
• Number of 0..3 arrays of length n with each element differing from at least one neighbor by 2 or more, starting with 0.at n=11A221510