294000

Appears in sequences

• a(n) is the number of sets of natural numbers [a,b,c,d,e] that can be produced with the numbers [0..n] such that the values of all the distinct parenthesized expressions of a-b-c-d-e are different.at n=13A054026
• Number of atoms in first n shells of type I hyperfullerene.at n=24A063497
• 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=32A090657
• 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=24A101817
• Primal codes of canonical finite permutations on positive integers.at n=17A109299
• a(n) = 4*(n^1 + 1!)*(n^2 + 2!)*(n^3 + 3!)*(n^4 + 4!)/4!.at n=4A131683
• Irregular triangle T(n,k) = binomial(n-1,m-1)*m!*A036040(n,k), where m=A036043(n,k), read by rows, 1 <= k <= A000041(n).at n=59A181417
• A Galton triangle: T(n,k) = 2*k*T(n-1,k) + (2*k-1)*T(n-1,k-1).at n=24A187075
• Triangular array read by rows: T(n,k) is the number of functions f:{1,2,...,n}->{1,2,...,n} with exactly k elements x such that |f^(-1)(x)| = 1; n>=0, 0<=k<=n.at n=31A206823
• Triangle T(n,k), 0<=k<=n, given by (0,2,0,4,0,6,0,8,0,10,0,...) DELTA (1, 2, 3, 4, 5, 6, 7, 8, 9,...) where DELTA is the operator defined in A084938.at n=32A211402
• 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=31A219859
• Triangle read by rows: T(n,k) (n>=1, 4<=k<=n+3) is the number of k-sequences of balls colored with at most n colors such that exactly three balls are of a color seen previously in the sequence.at n=24A292879
• Triangle read by rows: T(n,k) (n >= 1, 4 <= k <= n+3) is the number of k-sequences of balls colored with at most n colors such that exactly four balls are the same color as some other ball in the sequence.at n=24A292999
• Numbers with exactly four distinct exponents in their prime factorization, or four distinct parts in their prime signature.at n=25A323025
• Bisection of A324650: a(n) = A000010(A276086(2*n)).at n=58A324651
• Least k whose set of divisors contains exactly n Pythagorean triples, or 0 if no such k exists.at n=34A334382
• Triangle read by rows. T(n, k) = (-1)^(n-k)*(k+1)*binomial(n, k)*pochhammer(1-n, n-k).at n=40A360205
• 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=40A362789
• Obverse convolution (n)**A000984; see Comments.at n=4A374893
• Triangle read by rows: T(n,k) = Sum_{j=0..k} (-1)^(k-j) * binomial(k,j) * (5+j)^n.at n=32A391635