37590

Appears in sequences

• a(n) = n*(n+1)*(5*n + 4)/6.at n=35A162147
• Number of nX2 0..7 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=9A201095
• Numbers n = p * q, where n, p, and q together contain all 10 digits at least once.at n=47A253172
• Triangle read by rows: T(n, k) = Sum_{j=0..n} binomial(-j-1, -n-1)*S1(j, k) where S1 are the Stirling cycle numbers A132393.at n=47A269953
• E.g.f.: Product_{m>0} (1+x^m+x^(2*m)/2!+x^(3*m)/3!+x^(4*m)/4!).at n=7A293196
• Number of ways to write n as an ordered sum of nine powers of 2.at n=33A342252
• Triangle read by rows: T(n,k) is the number of partitions of set [n] into a set of at most k lists, with 0 <= k <= n. Also called broken permutations.at n=33A349776
• Products of 5 distinct primes that are sandwiched between twin prime numbers.at n=25A376380
• Expansion of e.g.f. log(1-x)^2 * exp(-x) / 2.at n=9A381064
• Irregular triangular array read by rows: T(n,k) is the number of periodic functions on [n] that have order k, n>=0, 1<=k<=A000793(n).at n=26A392061