1492992

Appears in sequences

• Triangle of coefficients in expansion of (1+12x)^n.at n=26A013619
• Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*1^j.at n=22A038327
• Numbers that are the product of their digits raised to positive integer powers.at n=29A059405
• For an integer k with prime factorization p_1*p_2*p_3* ... *p_m let k* = (p_1+1)*(p_2+1)*(p_3+1)* ... *(p_m+1) (A064478); sequence gives k such that k* is divisible by k.at n=29A064476
• Triangle with columns built from certain power sequences.at n=48A067417
• Fourth column of triangle A067417.at n=6A067419
• Triangle with columns built from certain power sequences.at n=38A067425
• 17-almost primes (generalization of semiprimes).at n=22A069278
• Triangular array T(n,k) read by rows, giving number of labeled free trees such that the root is smaller than all its children, with respect to the number n of vertices and to the label k of the root.at n=32A071211
• 12th binomial transform of (0,1,0,0,0,0,0,0,...).at n=6A081128
• a(n) = (2*n+1) * (2*n)! / (sqrt(4*(n+1)*Product_{k=1..2*n+1} lcm(k, 2*n+2-k))).at n=15A082292
• a(n) = A062401(2^n-1).at n=21A096853
• Expansion of (1+6x)/(1-12x^2).at n=11A107904
• Largest 3-smooth number dividing n!.at n=14A118381
• Cumulative product of A000120.at n=21A121853
• Integers n such that if you insert between each of their digits either "*" (times), "^" (exponentiation), or "nothing" (so that two or more digits are merged to form an integer), then you can recover n in a nontrivial way (however, two "^" mustn't be adjacent - you must avoid decompositions containing a^b^c).at n=7A156322
• Number of compositions of even natural numbers into 6 parts <= n.at n=11A191489
• Number of compositions of odd natural numbers into 6 parts <= n.at n=11A191901
• Discriminant of Chebyshev C-polynomials.at n=5A193678
• Numbers which can be written using their digits in order and only multiplication and squaring operators.at n=12A194766