30996

Appears in sequences

• Number of degree-n permutations of order exactly 4.at n=8A001473
• Number of partitions satisfying 0 < cn(1,5) + cn(4,5) + cn(2,5) and 0 < cn(1,5) + cn(4,5) + cn(3,5).at n=39A039902
• Denominators of continued fraction convergents to sqrt(85).at n=9A041151
• Prime alternating tangle types (of knots) with n crossings.at n=9A047051
• Irregular triangle read by rows: T(n,k) = number of elements of order k in symmetric group S_n, for n >= 1, 1 <= k <= g(n), where g(n) = A000793(n) is Landau's function.at n=52A057731
• Numbers k such that sigma(k+1) divides sigma(k), where sigma(k) is the sum of positive divisors of k.at n=33A058073
• a(n) = n*(n-1)^3*(n^2-n-1)/2.at n=7A101384
• Cascadence of (1+2x)^2; a triangle, read by rows of 2n+1 terms, that retains its original form upon convolving each row with [1,4,4] and then letting excess terms spill over from each row into the initial positions of the next row such that only 2n+1 terms remain in row n for n>=0.at n=36A120914
• G.f. satisfies: A(x) = C(2x)^2 * A(x^3*C(2x)^4), where C(x) is the g.f. of the Catalan numbers (A000108).at n=6A120915
• Triangle read by rows: T(n,k) is the number of hex trees with n edges and k pairs of adjacent vertices of outdegree 2.at n=24A126188
• Number of n X n binary arrays symmetric under 90-degree rotation with all ones connected only either two adjacent vertically or two adjacent horizontally.at n=10A145779
• a(n) = 137842*n - 106846.at n=0A157111
• a(n) = binomial(n+1,2)*6^2.at n=41A162940
• Triangle read by rows, T(n,k) for 0<=k<=n, generalizes the colored Motzkin paths of A107264.at n=29A201638
• Numbers k such that sigma(k) = 3*sigma(k+1).at n=2A217791
• Number of partitions of n such that (greatest part) + (least part) > number of parts.at n=41A237871
• Smallest fixed points (>0) of the base-n Kaprekar map.at n=13A319798
• Sum T(n,k) of multinomials M(n; lambda), where lambda ranges over all partitions of n into parts incorporating k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=49A327801
• Numbers that are the sum of seven fourth powers in exactly seven ways.at n=32A345829
• T(n, k) = binomial(n, k)*hypergeom([(1 - n)/2, -n/2], [1], 4).at n=38A376827