118125

Appears in sequences

• Triangle whose (n,k)-th entry is 15^(n-k)*binomial(n,k).at n=32A027467
• "DHK" (bracelet, identity, unlabeled) transform of 1,0,1,0,... (odd).at n=33A032243
• a(1)=6; if n = Product p_i^e_i, n>1, then a(n) = Product p_{i+1}^e_i * Product p_{i+2}^e_i.at n=23A045969
• Triangle read by rows: T(n,k)=binomial(n,k-1)*k^(k-1)*(n+1-k)^(n-k) (1<=k<=n).at n=23A103690
• Triangle read by rows: T(n,k) is the number of deco polyominoes of height n having along the lower contour exactly k reentrant corners, i.e., a vertical step that is followed by a horizontal step (n>=1, k>=0).at n=34A121579
• A certain partition array in Abramowitz-Stegun order (A-St order), called M_3(5).at n=36A134273
• Triangle of trinomial logarithmic coefficients: A027907(n,k) = Sum_{i=0..k} T(k,i)*n^i/k!.at n=60A136590
• Riordan array [exp(x^2/2+x^4/4),x].at n=57A152150
• Infinite product of triangle A167271 columns.at n=28A167273
• Triangular array read by rows. T(n,k) is the number of partial functions on n labeled objects in which the domain of definition contains exactly k elements such that for all i in {1,2,3,...}, (f^i)(x) is defined.at n=31A185390
• Triangular array read by rows: T(n,k) is the number of cubic n-permutations possessing exactly k cycles; n >= 0, 0 <= k <= n.at n=60A348191
• Pointwise product of the arithmetic derivative and the primorial base exp-function.at n=50A358669
• Triangular array read by rows. T(n,k) is the number of labeled posets on [n] of rank at most one with exactly k elements of positive indegree, n >= 0, 0 <= k <= max{0,n-1}.at n=25A369919
• a(n) is the conjectured largest number such that both a(n) and a(n) - n are 7-smooth numbers. a(n) can be less than n. Otherwise, if no such number exists then a(n) = 0.at n=26A376924
• a(n) = A276086(n) * A276086(sigma(n)-n), where A276086 is the primorial base exp-function, and sigma is the sum of divisors function.at n=37A388282