2239488
domain: N
Appears in sequences
- Numbers n such that n / product of digits of n is a square.at n=34A001104
- Triangle of coefficients in expansion of (1+6x)^n.at n=43A013613
- Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j).at n=37A038255
- a(n) = n*6^(n-1).at n=7A053469
- Numbers that are the product of their digits raised to positive integer powers.at n=30A059405
- 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=31A064476
- For an integer n with prime factorization p_1*p_2*p_3* ... *p_m let n* = (p_1+1)*(p_2+1)*(p_3+1)* ... *(p_m+1); sequence gives n* such that n* is divisible by n, ordered by increasing value of n.at n=17A064518
- 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 size k of the subtree rooted at the vertex labeled by 1.at n=36A071209
- Triangle with T(n,k)=n!*(k-1)^k/k! where 1<=k<=n.at n=34A076482
- Number of fault-free tilings of a 4 X 3n rectangle with right trominoes.at n=9A084477
- Number of subsets of the n-th roots of unity summing to a real number.at n=31A107848
- Largest order of any solvable transitive Galois group for an irreducible polynomial of degree n.at n=17A124900
- For definition see comments lines.at n=32A146892
- For definition see comments lines.at n=33A146892
- For definition see comments lines.at n=37A146892
- Numbers that can be written using its own digits in order and using multiplication and cubing operators.at n=3A195671
- Triangle T(n,k) = k^n * sum(binomial(n,n-k-j),j=0..n-k).at n=34A215079
- Integer areas A of the integer-sided triangles such that the inradius and the radius of the three excircles are perfect squares.at n=15A233317
- 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=53A244140
- 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=38A255908