36654
domain: N
Appears in sequences
- Growth function of an infinite cubic graph (number of nodes at distance <=n from fixed node).at n=43A038621
- Number of length n+6 0..2 arrays with no seven consecutive terms having the maximum of any two terms equal to the minimum of the remaining five terms.at n=7A250053
- Binomial transform of A339443(n).at n=14A350326
- Triangle read by rows: T(n,k) = number of connected quartic graphs on n vertices with crossing number k for n >= 1, k >= 0.at n=67A390644