32340

Appears in sequences

• a(n) = n^2*(n^2 - 1)/6.at n=21A008911
• a(n) = 28*(n+1)*binomial(n+6,8)/3.at n=4A027820
• a(n) = 21*(n+1)*binomial(n+6,9).at n=3A027821
• Triangle of B-analogs of Stirling numbers of the second kind.at n=51A039755
• Triangle of B-analogs of Stirling numbers of 2nd kind.at n=48A039756
• 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=15A074053
• a(n) = 3*n^3 + n^2 - 4*n.at n=22A083127
• Numbers whose number of divisors equals the sum of their separate prime-power decompositions.at n=15A087004
• Pentagonal numbers (A000326) whose digit reversal is the product of 2 palindromes greater than 1.at n=18A115703
• Pentagonal numbers for which the sum of the digits is also a pentagonal number.at n=18A117709
• Pentagonal numbers for which both the sum of the digits and the product of the digits are pentagonal numbers.at n=9A117711
• a(n) = 22 + floor( Sum_{j=1..n-1} a(j)/2 ).at n=18A120146
• Define an array by d(m, 0) = 1, d(m, 1) = m; d(m, k) = (m - k + 1) d(m+1, k-1) - (k-1) (m+1) d(m+2, k-2). Sequence gives d(n,3).at n=33A126935
• Triangle read by rows: A007318^(-1) * A132812.at n=74A132816
• Least pentagonal number P(m) > P(n) such that P(m)+P(n) is again a pentagonal number, 0 if no such m exists.at n=29A136114
• Numbers with exactly 5 distinct prime divisors {2,3,5,7,11}.at n=12A147572
• a(n) = 36*n^2 - 2*n.at n=29A158062
• Sums of 2 distinct primorials.at n=19A177689
• Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-3.at n=17A180293
• Numbers with prime factorization pqrs^2t^2.at n=8A189989