19834

Appears in sequences

• Dirichlet convolution of Fibonacci numbers with 3^(n-1).at n=9A034745
• Number of structurally isomeric homologs with molecular formula C_{3+n} H_{6+2n}.at n=12A063832
• Smallest squarefree integer k such that Q(sqrt(k)) has class number n.at n=37A081363
• G.f.: Product((1+x^i)/(1-x^i),i=1..n-1)/(1-x^n), with n = 8.at n=26A091779
• Indices of primes in sequence defined by A(0) = 87, A(n) = 10*A(n-1) - 13 for n > 0.at n=3A101072
• Concatenating n with n+1 (in base 10) gives a number which is the product of 2 palindromes.at n=15A113942
• Number of commutative semigroups of order <= n.at n=7A118100
• a(n) = 20 + floor( (1 + Sum_{j=1..n-1} a(j)) / 2 ).at n=17A120145
• Number of 0..2 arrays of length n+5 with sum no more than 6 in any length 6 subsequence (=50% duty cycle).at n=4A212227
• T(n,k)=Number of 0..2 arrays of length n+2*k-1 with sum no more than 2*k in any length 2k subsequence (=50% duty cycle).at n=25A212232
• Number of 0..2 arrays of length 4+2*n with sum no more than 2*n in any length 2n subsequence (=50% duty cycle).at n=2A212237
• T(n,k)=Number of length n+5 0..k arrays with no consecutive six elements summing to more than 3*k.at n=19A242144
• Number of length 5+5 0..n arrays with no consecutive six elements summing to more than 3*n.at n=1A242149
• Number of factorizations of m^n into 5 factors, where m is a product of exactly 5 distinct primes and each factor is a product of n primes (counted with multiplicity).at n=4A253263
• Number A(n,k) of factorizations of m^k into n factors, where m is a product of exactly n distinct primes and each factor is a product of k primes (counted with multiplicity); square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=50A257463
• Number of 3Xn arrays containing n copies of 0..3-1 with no element 1 greater than its north, west, northwest or northeast neighbor modulo 3 and the upper left element equal to 0.at n=14A266494
• Number of factorizations of m^4 into n factors, where m is a product of exactly n distinct primes and each factor is a product of 4 primes (counted with multiplicity).at n=5A268668
• a(n) = ((p-1)^n + (p+1)^n) mod p^2, where p is the n-th prime.at n=46A379544