62310
domain: N
Appears in sequences
- One-half of number of permutations of [n] with exactly one run of adjacent symbols differing by 1.at n=8A000239
- Irregular triangle read by rows: T(n,k) (n >= 1, 0 <= k <= [n/2]) = number of permutations of 1..n with [n/2]-k runs of consecutive pairs up and down (divided by 2).at n=27A010030
- Decimal representation of the strings formed by concatenating the digits of Pi in base 2.at n=6A164895
- Square array read by antidiagonals: T(n,k) is the number of simple labeled graphs G with vertex set V(G) = {v_1,...,v_n} along with a (coloring) function C:V(G) ->[k] such that v_i adjacent to v_j implies C(v_i) != C(v_j) and i<j implies C(v_i) <= C(v_j); n>=0, k>=0.at n=71A337161