322486272

Appears in sequences

• 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=28A064518
• Cumulative product of A000120.at n=26A121853
• Numbers that are products of distinct terms in A000312.at n=30A156223
• A coding sequence of binary based integers using powers of {2,3} for {0,1}.at n=12A176904
• The second largest value of permanent of (0,1) square matrices of order n with row and column sums equal to 3.at n=4A232636
• Superior 2-highly composite numbers: 3-smooth numbers (A003586) k for which there is a real number e > 0 such that d(k)/k^e >= d(j)/j^e for all 3-smooth numbers j, where d(k) is the number of divisors of k (A000005).at n=23A309016
• Terms of A025487 from which the distance to the next larger prime is a composite number.at n=24A329894
• Irregular triangle T(n,k) read by rows, where T(n,k) is the number of preference profiles in the stable marriage problem with n men and n women such that there exists a stable matching with an egalitarian cost of k.at n=28A344691
• Irregular triangle read by rows in which T(n,k) is the number of stable matchings in the stable marriage problem with n men and n women such that there exists a stable matching with an egalitarian cost of k.at n=28A344692
• Numbers k such that A072079(k)/k sets a new record.at n=37A355579
• 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); sequence gives k* such that k* is divisible by k.at n=28A380574