13436928

Appears in sequences

• a(n) = Sum_{k=0..2n} (k+1) * A026519(n, k).at n=15A027266
• a(n) = Sum_{k=0..2n} (k+1) * A026552(n, k).at n=15A027276
• a(n) = n*6^n.at n=8A036292
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*12^j.at n=26A038302
• Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*9^j.at n=22A038335
• Number of fault-free tilings of a 4 X 3n rectangle with right trominoes.at n=10A084477
• Bases and exponents in the prime decomposition of n replaced by composites with these indices.at n=23A141569
• Numbers expressible as A*B^A in two or more different ways, with A, B > 1.at n=13A171606
• a(n) = product of divisors of n that are not perfect powers.at n=71A183105
• Numbers which can be written using their digits in order and only multiplication and squaring operators.at n=21A194766
• Triangle read by rows: coefficients T(n,k) of a binomial decomposition of n*(-1)^n as Sum(k=0..n)T(n,k)*binomial(n,k).at n=63A244140
• Triangle read by rows: T(n,L) = number of rho-labeled graphs with n edges whose labeling is bipartite with boundary value L.at n=47A255908
• Numbers k such that A007954(k) divides k and k divides A007954(k)^2.at n=27A257554
• Expansion of g.f. (1+2*x)/(1-6*x).at n=9A270576
• Numbers n such that first digit of n divides n, last digit of n divides n, number of divisors of n divides n and phi(n) divides n, where phi(n) is the Euler totient function.at n=31A277804
• Records in A319100.at n=32A307252
• Cubefull highly composite numbers: numbers with a record number of cubefull divisors (A190867).at n=34A335850
• Zuckerman numbers which when divided by product of their digits, give a quotient which is also a Zuckerman number.at n=44A343681
• Number of ways to tile a double-hexagon strip of n hexagons, using single and double hexagons.at n=28A354541
• Products m of primorials (i.e., m in A025487) such that both m-1 and m+1 are not squarefree.at n=1A386526