43740

Appears in sequences

• Number of bracelets with n labeled beads of 3 colors.at n=6A032261
• Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*6^j.at n=23A038224
• Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*3^j.at n=25A038257
• a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049735.at n=27A049736
• Numbers k such that Sum_{j} p_j = Sum_{j} e_j where Product_{j} p_j^(e_j) is the prime factorization of k.at n=34A054411
• Saint-Exupéry numbers: ordered products of the three sides of Pythagorean triangles.at n=19A057096
• Triangle with n >= k >= 0 where a(n,k) = 2^k*3^(n-k)*(C(n+1,0)+C(n+1,1)+...C(n+1,k)).at n=37A061929
• Numbers k such that phi(prime(k)-1) == 0 (mod k).at n=12A067733
• Look at all numbers formed by multiplying the parts in a partition of n; a(n) = maximal such number which is divisible by n.at n=29A069188
• Positions of A080299 in A014486.at n=32A080298
• a(n) = 3*a(n-1), with a(1) = 20.at n=7A116530
• Numbers expressible in more than one way as 6^x-y^2.at n=19A134989
• Integers of the form A164577(k)/3.at n=38A164619
• Partial products of A007425.at n=7A175596
• Numbers with prime factorization pq^2r^7.at n=16A190466
• The arithmetic mean of the prime factors (with multiplicity) of n is 3.at n=39A200612
• a(n) = n^4*(n-1)*(n+1)/12.at n=8A208954
• A014486-indices for the Beanstalk-tree growing one natural number at time, starting from the tree of one internal node (1), with the "lesser numbers to the left hand side" construction.at n=10A218777
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 521", based on the 5-celled von Neumann neighborhood.at n=36A272736
• Triangle read by rows: T(n,k) is the number of ternary words of length n having degree of asymmetry equal to k (n>=0; 0<=k<=n/2).at n=44A274498