30576

Appears in sequences

• a(n) = A259095(2n,n).at n=24A005575
• a(n) = self-convolution of row n of array T given by A027157.at n=5A027169
• a(n) = n^2*(n-1)*(n-2).at n=12A047929
• Expansion of (1 - x)/(1 - 2*x - 2*x^2 + 2*x^3).at n=12A052528
• McKay-Thompson series of class 24B for Monster.at n=31A058572
• Coefficient triangle of certain polynomials N(5; m,x).at n=48A062190
• Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,27.at n=13A064250
• Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,45.at n=13A064259
• Array read by antidiagonals: T(r,n) = number of two-stack sortable r-permutations.at n=49A093346
• Triangle read by rows: T(n,k) = (n+1,k)-th element of (M^3-M)/2, where M is the infinite lower Pascal's triangle matrix, 1<=k<=n.at n=39A096034
• a(n) = binomial(n+6, 6) * binomial(n+11, n).at n=3A104674
• a(n) = binomial(n+3,3)*binomial(n+8,3).at n=6A104677
• a(n) = C(3+2*n,3+n)*C(8+2*n,0+n).at n=3A114251
• Triangle read by rows: T(n,k) is the number of ternary sequences of length n containing k subsequences 000 (consecutively; n,k>=0).at n=59A119825
• Number of binary strings of length n with no substrings equal to 0000, 0101, or 1111.at n=19A164437
• Jordan function ratio J_6(n)/J_2(n).at n=11A194532
• a(n) = 2^n - A000031(n).at n=15A209970
• Maximum value of sigma(x) * sigma(y) * sigma(z), where x + y + z = n.at n=39A211219
• McKay-Thompson series of class 24B for the Monster group with a(0) = 2.at n=31A212771
• Triangular array read by rows: T(n,k) is the number of connected components with size k summed over all simple labeled graphs on n nodes; n>=1, 1<=k<=n.at n=25A223894