29520

Appears in sequences

• a(n+2) = (2n+3)*a(n+1) + (n+1)^2*a(n), a(0) = 1, a(1) = 1.at n=6A012244
• Number of 1's in n-th term of A006711.at n=38A022477
• a(n) = n*(n^4-1)/2.at n=7A027484
• Number of partitions in parts not of the form 25k, 25k+1 or 25k-1. Also number of partitions with no part of size 1 and differences between parts at distance 11 are greater than 1.at n=49A036000
• Numbers having four 4's in base 9.at n=16A043472
• Number of permutations on n letters that have only cycles of length 6 or less.at n=8A070947
• 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=37A096034
• Expansion of psi(-q^3) / psi(-q)^3 in powers of q where psi() is a Ramanujan theta function.at n=20A132974
• Expansion of psi(q^3) / psi(q)^3 in powers of q where psi() is a Ramanujan theta function.at n=20A132979
• Triangle T(n, k) = k*(n-1)! - k!, read by rows.at n=33A137260
• Triangle T, read by rows, such that row n equals column 0 of matrix power M^n where M is a triangular matrix defined by M(k+m,k) = binomial(k+m,k) for m=0..2 and zeros elsewhere. Width-2-restricted finite functions.at n=42A141765
• Expansion of 3*x*(3*x+1)*(2*x-1) / ( (1+x)*(3*x^2+1) ).at n=17A143769
• a(n) = binomial(n+1,2)*6^2.at n=40A162940
• Number of n-cycles on the graph of the regular 600-cell, 3 <= n <= 120.at n=2A167985
• a(n) = 9*(3^n - 1)/2.at n=8A168569
• Number of lobsters with n nodes that are not caterpillars.at n=14A186308
• Numbers with prime factorization pqr^2s^4.at n=33A190107
• Increasing sequence S generated by these rules: 1 is in S, and if x is in S then 3x and floor((x^2)/2) are in S.at n=57A191285
• Number of nonnegative integers with property that their base 6/5 expansion (see A024638) has n digits.at n=50A245399
• Triangle read by rows: T(m,n) = number of ways of distributing n distinguishable balls into m distinguishable bins of size 2 where empty bins are permitted (m >= 1, 1 <= n <= 2m).at n=35A248844