113256

Appears in sequences

• Number of simple unlabeled n-node graphs of edge-connectivity 2.at n=8A052447
• Number of double points of the map that, for each term t of a sequence, counts the preceding terms that are greater than or equal to t.at n=11A071962
• Number of rooted maps of (orientable) genus 3 containing n edges.at n=1A104742
• a(n) = (n+1)^2*(n+2)^3*(n+3)/24.at n=10A108648
• Numbers whose base-10 and base-7 representations are permutations of the same multiset of digits.at n=59A130604
• Number of permutations of 2 copies of 1..n avoiding adjacent step pattern up, up, down, down, down, down.at n=4A177589
• Number of binary sequences of length n having a conjugate at Hamming distance 2.at n=25A179674
• Irregular triangle read by rows: the W-transformation of the Catalan triangle A033184.at n=42A228337
• Triangle T(n,k) read by rows: T(n,k) is the number of rooted genus-k maps with n edges, n>=0, 0<=k<=n.at n=31A238396
• Triangle read by rows: T(n,k) is the number of graphs with n vertices with edge connectivity k.at n=38A263296
• Triangle read by rows: T(n,g) is the number of rooted maps with n edges on an orientable surface of genus g.at n=19A269919
• Number of ordered ways of writing n-th prime number as a sum of n primes.at n=11A299168
• Square array read by ascending antidiagonals: T(n,k) = (2*k)!/k!^2 * ( (2*n*k)! * ((n + 2)*k)! )/( (n*k)! * ((n + 1)*k)!^2 ) for n, k > = 0.at n=23A364509