39690

Appears in sequences

• Reduced denominators of series expansion for integrand in Renyi's parking constant.at n=7A050995
• Digital sum of n = sum of palindromes from the smallest prime factor of n to the largest prime factor of n.at n=15A074310
• a(n) = 9*a(n-1) - 9*a(n-2) + a(n-3); given a(1) = 1, a(2) = 10, a(3) = 81.at n=5A095004
• Triangle T(n,k), 0<=k<=n, read by rows, defined by : T(0,0) = 1, T(n,k) = 0 if n<k or if k<0, T(n,k) = k*T(n-1, k-1) + (2n-2k-1)*T(n-1, k).at n=30A108032
• Triangle, read by rows, defined by T(n,k) = A000108(n-k)*A001147(k)*C(n,2*k), for k=0..[n/2], n>=0, where A000108 is the Catalan numbers and A001147 is the double factorials.at n=29A125080
• Triangle, read by rows, defined by T(n,k) = A000108(n-k)*A001147(k)*C(n,2*k), for k=0..[n/2], n>=0, where A000108 is the Catalan numbers and A001147 is the double factorials.at n=35A125080
• Product of the nonzero digital products of all the prime numbers prime(1) to prime(n).at n=7A127482
• a(n) = (4*n^3 + n^2 - 3*n)/2.at n=27A172073
• a(n) gives the number of nonisomorphic connected compact Lie groups of dimension n which are simple products.at n=61A177821
• Partial sums of A068148.at n=32A178137
• Smallest number which is an unordered sum of two odd abundant numbers in exactly n ways.at n=28A187743
• G.f.: exp( Sum_{n>=1} A055457(n) * 5^A055457(n) * x^n/n ) where 5^A055457(n) exactly divides 5*n.at n=17A195761
• Coefficient array for the monic X_1-Laguerre polynomials with parameter k=1.at n=40A199580
• The Wiener index of the ortho-polyphenyl chain with n hexagons (see the Dou et al. and the Deng references).at n=13A216108
• T(n,k)=Number of length n+3 0..k arrays with no pair in any consecutive four terms totalling exactly k.at n=46A246479
• Number of length 2+3 0..n arrays with no pair in any consecutive four terms totalling exactly n.at n=8A246481
• Triangle read by rows: Take a hexagon with all diagonals drawn, as in A331931. Then T(n,k) = number of k-sided polygons in that figure for k = 3, 4, ..., n+4.at n=33A331932
• Triangle read by rows: T(n,k) is the number of trees with n leaves of exactly k colors and all non-leaf nodes having degree 3.at n=43A339650
• a(n) = 1*binomial(n,2) + 3*binomial(n,3) + 6*binomial(n,4) + 10*binomial(n,5).at n=15A361474
• Diagonal of rational function 1/(1 - (x^2 + y^2 + z^2 + x^3*y*z)).at n=8A361738