decompwlj 3D

Divisor functions · 58 sequences

The sequences of the family “divisor functions”, by A-number, with the share of their decomposable terms in the level class (k > L).

A-numberNameLevel
A001838Numbers k such that phi(k+2) = phi(k) + 244.8 %
A002202Values taken by totient function phi(m) (A000010)12.6 %
A003277Cyclic numbers: k such that k and phi(k) are relatively prime; also k such that there is just one group of order k, i.e., A000001(k) = 115.1 %
A003601Numbers j such that the average of the divisors of j is an integer: sigma_0(j) divides sigma_1(j). Alternatively, numbers j such that tau(j) (A000005(j)) divides sigma(j) (A000203(j))11.9 %
A005100Deficient numbers: numbers k such that sigma(k) < 2k7.8 %
A005101Abundant numbers (sum of divisors of m exceeds 2m)14.9 %
A005153Practical numbers: positive integers m such that every k <= sigma(m) is a sum of distinct divisors of m. Also called panarithmic numbers17.5 %
A005237Numbers k such that k and k+1 have the same number of divisors21.9 %
A005277Nontotients: even numbers k such that phi(m) = k has no solution10.7 %
A005279Numbers having divisors d, e with d < e < 2*d15.2 %
A005598a(n) = 1 + Sum_{i=1..n} (n-i+1)*phi(i)100.0 %
A006532Numbers whose sum of divisors is a square45.4 %
A007617Values not in range of Euler phi function11.1 %
A023197Numbers k such that sigma(k) >= 3*k16.8 %
A028983Numbers whose sum of divisors is even9.6 %
A030513Numbers with 4 divisors15.7 %
A030515Numbers with exactly 6 divisors27.4 %
A030626Numbers with exactly 8 divisors16.5 %
A0306281 together with numbers of the form p*q^4 and p^9, where p and q are distinct primes29.8 %
A030630Numbers with 12 divisors21.3 %
A030634Numbers with 16 divisors19.9 %
A030638Numbers with 20 divisors25.9 %
A034683Unitary abundant numbers: numbers k such that usigma(k) > 2*k14.6 %
A036433Number of divisors is a digit in the base 10 representation of n12.9 %
A036455Numbers n such that d(d(n)) is an odd prime, where d(k) is the number of divisors of k14.2 %
A036537Numbers whose number of divisors is a power of 210.2 %
A039770Numbers k such that phi(k) is a perfect square41.3 %
A045746Numbers whose sum of divisors is a triangular number63.0 %
A046642Numbers k such that k and number of divisors d(k) are relatively prime16.7 %
A048109Numbers having equally many squarefree and nonsquarefree divisors; number of unitary divisors of n (A034444) = number of non-unitary divisors of n (A048105)21.5 %
A053224Numbers k for which sigma(k) < sigma(k+1)16.0 %
A053868Numbers whose sum of proper divisors is odd17.9 %
A054741Numbers m such that totient(m) < cototient(m)10.2 %
A055638Numbers k for which sigma(k^2) is prime50.4 %
A059269Numbers m for which the number of divisors, tau(m), is divisible by 316.9 %
A062634Numbers k such that every divisor of k contains the digit 123.2 %
A065496Numbers n such that sigma(n) is a nontrivial power, i.e., sigma(n) = a^b where a and b are greater than 144.3 %
A069059Numbers k such that k and sigma(k) are not relatively prime12.6 %
A071395Primitive abundant numbers (abundant numbers all of whose proper divisors are deficient numbers)53.8 %
A074627Numbers n such that sigma(n) is divisible by 69.2 %
A087248Squarefree abundant numbers15.0 %
A088723Numbers k with at least one divisor d>1 such that d+1 also divides k14.5 %
A091191Primitive abundant numbers: abundant numbers (A005101) having no abundant proper divisor25.3 %
A111592Admirable numbers. A number n is admirable if there exists a proper divisor d' of n such that sigma(n)-2d'=2n, where sigma(n) is the sum of all divisors of n24.8 %
A112886Positive integers that have no triangular divisors > 12.3 %
A113502A number n is included if at least one of its divisors > 1 is a triangular number (i.e., is of the form m(m+1)/2, m >= 2)14.5 %
A123193Natural numbers with number of divisors equal to a Fibonacci number14.0 %
A145749Numbers n such that sigma(n)+phi(n)=sigma(n+1)+phi(n+1)47.3 %
A162527Numbers k whose largest divisor <= sqrt(k) equals 723.1 %
A174905Numbers with no pair (d,e) of divisors such that d < e < 2*d8.6 %
A175495Positive integers k such that k < 2^d(k), where d(k) is the number of divisors of k16.6 %
A179188Numbers n such that phi(n) = phi(n+6), with Euler's totient function phi=A00001038.0 %
A217139Numbers n such that phi(n) = phi(n+12), with Euler's totient function phi = A00001038.2 %
A230577Positive integers that have exactly 6 odd divisors24.9 %
A236562Numbers n such that A049820(x) = n has a solution11.9 %
A257219Numbers that have at least one divisor containing the digit 2 in base 1010.6 %
A257220Numbers that have at least one divisor containing the digit 3 in base 1011.3 %
A274357Numbers n such that n and n+1 both have 8 divisors24.7 %