3386880

Appears in sequences

• There exists some k>0 such that n is the product of (k + digits of n).at n=29A055482
• Matrix square of unsigned Lah triangle abs(A008297(n,k)) or A105278(n,k).at n=40A079621
• Number of divisors of n! that are coprime to n.at n=44A095997
• Numbers n such that n=(d_1+4)*(d_2+4)*...*(d_k+4) where d_1 d_2 ... d_k is the decimal expansion of n.at n=6A098114
• A coefficient tree from the list partition transform relating A000129, A000142, A000165, A110327, and A110330.at n=21A131980
• Irregular triangle read by rows: coefficients of Laplace transform of a Bernoulli expansion: LaplaceTransform[t*Exp[x*t]/(Exp[t] - 1), t, 1/t] = Zeta[2,1+1/t-x]->shifted to Zeta[4,1+1/t-x].at n=30A137496
• Triangular sequence of coefficients from the expansion of the derivative of the Bernoulli polynomial function: p(x,t) = t*exp(x*t)/(exp(t)-1); q(x,t) = p'(x,t) = dp(x,t)/dt.at n=42A137777
• Triangle read by rows, based on the two-variable g.f. exp(x*t)*(x*(1 - 2*exp(x)) - 2*exp(x))/(1 - exp(t)) (the first of two parts).at n=58A138133
• Number of permutations of floor(i*6/5), i=0..n-1, with all sums of 8 adjacent terms unique.at n=9A152699
• Number of permutations of floor(i*7/6), i=0..n-1, with all sums of 8 adjacent terms unique.at n=9A152704
• Number of permutations of floor(i*8/7), i=0..n-1, with all sums of 8 adjacent terms unique.at n=9A152707
• Triangular array read by rows. T(n,k) is the number of necklaces (turning over is not allowed) of n labeled black or white beads having exactly k black beads.at n=48A219570
• Triangular array read by rows. T(n,k) is the number of necklaces (turning over is not allowed) of n labeled black or white beads having exactly k black beads.at n=51A219570
• Table: T(n,k) = n!*binomial(n+1,2*k).at n=27A228955
• Triangular array read by rows: T(n,k) is the number of rooted labeled trees on n nodes that have exactly k nodes with outdegree = 1, n>=1, 0<=k<=n-1.at n=41A231602
• The number of permutations of 1, 2,..., n such that none of 123, 132, 213, 231, 312, 321 appear in the permutation.at n=10A269889
• Triangle read by rows: T(n,k) (n>=1, 3<=k<=n+2) is the number of k-sequences of balls colored with at most n colors such that exactly three balls are the same color as some other ball in the sequence.at n=34A292930
• Triangle read by rows: T(n,k) (n>=1, 3<=k<=n+2) is the number of k-sequences of balls colored with at most n colors such that exactly three balls are the same color as some other ball in the sequence.at n=41A292930
• Triangle read by rows. T(n, k) = n! * binomial(n - 1, k - 1) / (n - k)!.at n=51A361893
• Numbers k such that there exist three numbers x, y and z such that k = psi(x) = psi(y) = psi(z) = x + y + z.at n=11A387290