33852

Appears in sequences

• Product of the anti-divisors of n.at n=43A091507
• Lcm[{ad(n)}], i.e. the least common multiple of the anti-divisors of n.at n=43A096357
• Numbers k such that 5^k mod k = 5^k mod k^2.at n=39A125775
• Numbers k such that k^2 divides 5^k-1.at n=30A127105
• T(n,m) = Sum_{j=0..m} (-1)^(j + m)*(j + 1)^n*binomial(m, j) + Sum_{j=0..(n-m)} (-1)^(j - m + n )*(1 + j)^n*binomial(n-m, j).at n=30A156820
• T(n,m) = Sum_{j=0..m} (-1)^(j + m)*(j + 1)^n*binomial(m, j) + Sum_{j=0..(n-m)} (-1)^(j - m + n )*(1 + j)^n*binomial(n-m, j).at n=33A156820
• a(n) is the number of digits in the decimal expansion of Pi needed to contain a repeated n-digit substring.at n=8A159345
• Maximum value of sigma(x) * sigma(y) * sigma(z), where x + y + z = n.at n=43A211219
• Number of n X 3 0..1 arrays with rows and antidiagonals unimodal and columns nondecreasing.at n=35A224141
• Number of (n+2) X (1+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 1 3 4 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 1 3 4 6 or 7.at n=5A252543
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 1 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 1 3 4 6 or 7.at n=20A252544
• Number of (6+2)X(n+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 1 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 1 3 4 6 or 7.at n=0A252549
• Triangle read by rows: T(n,k) is the number of rooted maps with n edges whose core comprises k edges, 1 <= k <= n.at n=33A318106
• Numbers k such that all primes dividing the k-th composite number divide k as well.at n=38A368309
• Number of sets of lists of [n] such that one list is the largest.at n=7A386497