27024

Appears in sequences

• Numbers that are equal to the sum of their anti-divisors.at n=9A073930
• Harmonic anti-divisor numbers.at n=13A192272
• Number of 0..3 arrays of length n+5 with sum no more than 9 in any length 6 subsequence (=50% duty cycle).at n=2A212466
• T(n,k)=Number of 0..3 arrays of length n+2*k-1 with sum no more than 3*k in any length 2k subsequence (=50% duty cycle).at n=12A212471
• Number of 0..3 arrays of length 2*n+2 with sum no more than 3*n in any length 2n subsequence (=50% duty cycle).at n=2A212474
• Anti-multiply-perfect numbers. Numbers n for which sigma*(n)/n is an integer, where sigma*(n) is the sum of the anti-divisors of n.at n=14A214842
• Let sigma*_m (n) be result of applying sum of anti-divisors m times to n; call n (m,k)-anti-perfect if sigma*_m (n) = k*n; sequence gives the (2,k)-anti-perfect numbers.at n=27A229860
• Let sigma*_m (n) be result of applying sum of anti-divisors m times to n; call n (m,k)-anti-perfect if sigma*_m (n) = k*n; sequence gives the (3,k)-anti-perfect numbers.at n=18A229861
• Let sigma*_m (n) be result of applying sum of anti-divisors m times to n; call n (m,k)-anti-perfect if sigma*_m (n) = k*n; sequence gives the (4,k)-anti-perfect numbers.at n=25A229862
• Number of partitions p of n such that (sum of parts with multiplicity 1) < (sum of all other parts).at n=42A240448
• T(n,k)=Number of length n+5 0..k arrays with no consecutive six elements summing to more than 3*k.at n=12A242144
• Number of length 3+5 0..n arrays with no consecutive six elements summing to more than 3*n.at n=2A242147
• Numbers n whose sum of anti-divisors is a permutation of their digits.at n=42A258786
• Number of nX2 arrays of permutations of 0..n*2-1 with rows nondecreasing modulo 4 and columns nondecreasing modulo 6.at n=7A264726