63210
domain: N
Appears in sequences
- Expansion of (Product_{j>=1} (1-(-x)^j) - 1)^15 in powers of x.at n=17A047640
- Values of n such that N=(an+1)(bn+1)(cn+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,33.at n=15A064253
- Triangle read by rows: T(n,k) = number of functions from [1,2,...,n] to [1,2,...,n] such that the image contains exactly k elements (0<=k<=n).at n=31A090657
- Triangle read by rows: T(n,h) = number of functions f:{1,2,...,n}->{1,2,...,n} such that |Image(f)|=h; h=1,2,...,n, n=1,2,3,... . Essentially A090657, but without zeros.at n=23A101817
- Triangular array read by rows: T(n,k) is the number of endofunctions, functions f:{1,2,...,n}->{1,2,...,n}, that have exactly k elements with no preimage; n>=0, 0<=k<=n.at n=32A219859
- Total number of compositions in the compositions of partitions of n.at n=12A327548
- Triangle read by rows. T(n, k) = FallingFactorial(n - k, k) * Stirling2(n - k, k), for n >= 0 and 0 <= k <= n//2, where '//' denotes integer division.at n=33A362789
- Triangle of numbers read by rows, T(n, k) = (n*(n-1)*(n-2))*Stirling2(k, 3), for n >= 1 and 1 <= k <= n.at n=27A362791
- a(n) is the largest integer with distinct digits whose digital sum is n.at n=12A381645