381024
domain: N
Appears in sequences
- Coefficients of Laguerre polynomials.at n=4A001812
- a(n) = Product_{i=0..6} floor((n+i)/7).at n=44A009641
- Numbers of form 6^i*7^j, with i, j >= 0.at n=30A025626
- Row sums of triangle A131336.at n=22A131337
- Number of permutations of n elements divided by the number of (binary) heaps on n+1 elements.at n=19A133385
- Partition number array, called M31(6), related to A049374(n,m)= |S1(6;n,m)| (generalized Stirling triangle).at n=31A144356
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 1), (1, 0, -1), (1, 1, 0), (1, 1, 1)}.at n=9A150963
- Numbers k such that rad(k)^2 divides sigma(k).at n=18A173615
- Number of ways to place 4 nonattacking bishops on an n X n toroidal board.at n=8A177757
- Number of non-attacking placements of 4 rooks on an n X n board.at n=8A179059
- Triangle read by rows, defined by T(n,k)=binomial(n,k)*|Stirling1(n,k)|, 0<=k<=n.at n=51A187555
- Triangle read by rows: T(n,k) (0 <= k <= n) = number of elements of alternating semigroup A_n of height k.at n=49A283321
- Triangle read by rows. T(n, k) = binomial(n, k) * n! / (n - k + 1)! if k >= 1, if k = 0 then T(n, k) = k^n. T(n, k) for 0 <= k <= n.at n=50A350266
- Triangle read by rows: T(n, k) = binomial(n, k - 1)*(k - 1)^(k - 1)*n*(n - k + 1)^(n - k).at n=30A369018
- Numbers that have exactly two exponents in their prime factorization that are equal to 5.at n=18A386809