26136

Appears in sequences

• Numbers n such that n / product of digits of n is a square.at n=21A001104
• Triangle read by rows: T(n, k) = (k+1)*A132393(n+1, k+1), for 0 <= k <= n.at n=29A028421
• Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*11^j.at n=12A038265
• Triangle whose (i,j)-th entry is binomial(i,j)*11^(i-j)*6^j.at n=12A038320
• Triangle T(n,k) = k! * Stirling1(n,k), 1<=k<=n.at n=29A048594
• Number of ordered pairs of cycles over all n-permutations having two cycles.at n=8A052517
• Exponential transform of Stirling1 triangle A008275.at n=29A055924
• Number of primitive (period n) bracelet structures using exactly four different colored beads.at n=11A056368
• Numbers n such that A001414(n) = sum of composites from the smallest prime factor of n to the largest prime factor of n.at n=12A074053
• Coefficients of certain polynomials (rising powers).at n=34A075181
• Group the natural numbers such that the sum of the terms of every group has a distinct prime signature not occurring earlier: (1), (2), (3, 4, 5), (6), (7, 8, 9), (10, 11, 12, 13, 14), (15, 16, 17), (18, 19, 20, 21)... Sequence contains the sum of the terms of groups.at n=44A086494
• Prime power perfect numbers: If n = Product p_i^r_i let PPsigma(n) = Product {Sum p_i^s_i, 2<=s_i<=r_i, s_i is prime}; sequence gives numbers k such that PPsigma(k) = 2*k.at n=3A096290
• Numbers of the form (6^i)*(11^j), with i, j >= 0.at n=17A108698
• Numbers with at least two 3s in their prime signature.at n=62A109399
• Sum of third powers of four consecutive primes.at n=5A133525
• Numbers which can be expressed as the product of numbers made of only sixs.at n=15A161144
• Numbers k such that phi(tau(k)) = sopf(k).at n=32A173326
• Eight rooks and one berserker on a 3 X 3 chessboard. G.f.: (1 + x - 2*x^2)/(1 - 3*x - 6*x^2).at n=7A180141
• Numbers with prime factorization p^2*q^3*r^3 where p, q, and r are distinct primes.at n=5A190106
• a(n) = n! * Sum_{d|n} H(d)*H(n/d), where H(n) is the n-th harmonic number.at n=6A193445