222936

Appears in sequences

• From George Gilbert's marks problem: jumping 6 marks at a time (initial positions).at n=30A019995
• Expansion of Product_{m>=1} (1 + m*q^m)^12.at n=7A022640
• Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A082351/A082352.at n=13A089424
• Irregular triangular array read by rows. T(n,k) is the number of connected labeled bipartite graphs on n nodes with exactly k edges; n >= 1, 0 <= k <= A002620(n+1).at n=52A228861
• a(n) = r * (n-1)! where r is the rational number that satisfies the equation Sum_{k>=n} (-1)^(k + n)/C(k,n) = n*2^(n-1)*log(2) - r.at n=6A242091
• Number of ways to reciprocally link elements of an n X n X n triangular array with themselves or a neighbor, with no more than n elements linked to themselves.at n=5A271609
• Number of ways to reciprocally link elements of an n X n X n triangular array with themselves or a neighbor, with no more than 5 elements linked to themselves.at n=5A271614
• Number of ways to reciprocally link elements of an n X n X n triangular array with themselves or a neighbor, with no more than 6 elements linked to themselves.at n=5A271615
• T(n,k) = Number of ways to reciprocally link elements of an n X n X n triangular array with themselves or a neighbor, with no more than k elements linked to themselves.at n=50A271617