63605
domain: N
Appears in sequences
- Triangle read by rows: T(n,k) (n>=0, k=0..n) gives number of connected graphs on n nodes with edge chromatic number k.at n=52A126732
- Floor(1/{(5+n^4)^(1/4)}), where {}=fractional part.at n=42A184629
- Number of arrays of median of three adjacent elements of some length 7 0..n array, with no adjacent equal elements in the latter.at n=9A229015
- Number of intersection points when every pair of vertices of a row of n adjacent congruent rectangles are joined by an infinite line.at n=22A347750