Sequences
392,541 sequences
- Numbers k such that z(k) = j(k), where z(k) = sopf(k - d(k)), j(k) = d(sopf(k) + k), sopf(k) = A008472(k) and d(k) = A000005(k).A063961
Numbers k such that z(k) = j(k), where z(k) = sopf(k - d(k)), j(k) = d(sopf(k) + k), sopf(k) = A008472(k) and d(k) = A000005(k).
- Number of distinct prime divisors of n that are <= sqrt(n).A063962
Number of distinct prime divisors of n that are <= sqrt(n).
- Numbers k such that k and k+2540 have the same number of divisors.A063963
Numbers k such that k and k+2540 have the same number of divisors.
- Numbers k such that k and k+1 have the same sum of squarefree divisors, or sqf(k) = sqf(k+1), where sqf(k) = A048250(k).A063964
Numbers k such that k and k+1 have the same sum of squarefree divisors, or sqf(k) = sqf(k+1), where sqf(k) = A048250(k).
- Size of the automorphism group of the group S_n x S_n (where S_n is the symmetric group).A063965
Size of the automorphism group of the group S_n x S_n (where S_n is the symmetric group).
- Number of Abelian groups of order <= n.A063966
Number of Abelian groups of order <= n.
- Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.A063967
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
- Numbers k such that sopf(k) = sopf(k+2), where sopf(k) = A008472(k).A063968
Numbers k such that sopf(k) = sopf(k+2), where sopf(k) = A008472(k).
- Numbers k such that sopf(k) = sopf(k+3), where sopf(k) = A008472(k).A063969
Numbers k such that sopf(k) = sopf(k+3), where sopf(k) = A008472(k).
- a(1) = 2; for n>1, write down all divisors of the previous term in order of magnitude.A063970
a(1) = 2; for n>1, write down all divisors of the previous term in order of magnitude.
- Values of n for which A013939(n)/n is an integer.A063971
Values of n for which A013939(n)/n is an integer.
- a(n) is the smallest m such that usigma(m) = n (or 0 if no such m).A063972
a(n) is the smallest m such that usigma(m) = n (or 0 if no such m).
- a(n) is the largest m such that usigma(m) = n (or 0 if no such m).A063973
a(n) is the largest m such that usigma(m) = n (or 0 if no such m).
- Number of terms in inverse set of usigma = sum of unitary divisors = A034448.A063974
Number of terms in inverse set of usigma = sum of unitary divisors = A034448.
- Smallest numbers such that the number of terms in inverse set usigma equals n; where usigma = A034448.A063975
Smallest numbers such that the number of terms in inverse set usigma equals n; where usigma = A034448.
- Duplicate of A064000.A063976
Duplicate of A064000.
- Numbers which are sums of unitary divisors, the usigma values: their inverse usigma set is not empty; usigma() = A034448().A063977
Numbers which are sums of unitary divisors, the usigma values: their inverse usigma set is not empty; usigma() = A034448().
- Sum_{i for which n - i*(i-1)/2 >= 0} binomial (n - i*(i-1)/2, i).A063978
Sum_{i for which n - i*(i-1)/2 >= 0} binomial (n - i*(i-1)/2, i).
- Number of decimal digits in (n!)!; A000197.A063979
Number of decimal digits in (n!)!; A000197.
- Pillai primes: primes p such that there exists an integer m such that m! + 1 == 0 (mod p) and p != 1 (mod m).A063980
Pillai primes: primes p such that there exists an integer m such that m! + 1 == 0 (mod p) and p != 1 (mod m).
- Numbers n such that t(n) = sigma(n) - n, where t(n) = A008472(n+1) - A008472(n).A063981
Numbers n such that t(n) = sigma(n) - n, where t(n) = A008472(n+1) - A008472(n).
- Number of divisors of 2^n - 1 that are relatively prime to 2^m - 1 for all 0 < m < n.A063982
Number of divisors of 2^n - 1 that are relatively prime to 2^m - 1 for all 0 < m < n.
- Least k such that k*2^n +/- 1 are twin primes.A063983
Least k such that k*2^n +/- 1 are twin primes.
- Minimal number of integer points in the Euclidean plane which are contained in the interior of any convex n-gon whose vertices have integer coordinates.A063984
Minimal number of integer points in the Euclidean plane which are contained in the interior of any convex n-gon whose vertices have integer coordinates.
- Partial sums of cototient sequence A051953.A063985
Partial sums of cototient sequence A051953.
- Numbers k that divide Sum_{j=1..k} A051953(j) where A051953(j) = j - Phi(j). Arithmetic mean of first k cototient values is an integer.A063986
Numbers k that divide Sum_{j=1..k} A051953(j) where A051953(j) = j - Phi(j). Arithmetic mean of first k cototient values is an integer.
- Irregular triangle in which n-th row gives quadratic residues modulo the n-th prime.A063987
Irregular triangle in which n-th row gives quadratic residues modulo the n-th prime.
- Triangle in which n-th row gives quadratic non-residues modulo the n-th prime.A063988
Triangle in which n-th row gives quadratic non-residues modulo the n-th prime.
- Numbers with a prime number of prime divisors (counted with multiplicity).A063989
Numbers with a prime number of prime divisors (counted with multiplicity).
- Amicable numbers.A063990
Amicable numbers.
- Unitary amicable numbers.A063991
Unitary amicable numbers.
- Numbers that are not factorials.A063992
Numbers that are not factorials.
- Number of ways of writing n as an unordered sum of exactly 3 nonzero triangular numbers.A063993
Number of ways of writing n as an unordered sum of exactly 3 nonzero triangular numbers.
- a(n) = Product_{primes p dividing n } gcd(p-1, n-1).A063994
a(n) = Product_{primes p dividing n } gcd(p-1, n-1).
- Irregular triangle read by rows: T(n,k), n >= 1, -(n-1) <= k <= n-1, = number of partitions of n with rank k.A063995
Irregular triangle read by rows: T(n,k), n >= 1, -(n-1) <= k <= n-1, = number of partitions of n with rank k.
- Numbers k such that ud(k) = sopf(k)-1, where ud(k)=A034444(k) and sopf(k)=A008472(k).A063996
Numbers k such that ud(k) = sopf(k)-1, where ud(k)=A034444(k) and sopf(k)=A008472(k).
- Multiples of 4 whose digits add to 4.A063997
Multiples of 4 whose digits add to 4.
- Nonsquare, composite numbers k such that Sum_{d|k, d < k/d} s_d = k+1, where s_d is either d+1/(k/d) or (1/d)+(k/d).A063998
Nonsquare, composite numbers k such that Sum_{d|k, d < k/d} s_d = k+1, where s_d is either d+1/(k/d) or (1/d)+(k/d).
- Numbers k such that the number of primes <= k is phi(phi(k)).A063999
Numbers k such that the number of primes <= k is phi(phi(k)).
- Unitary untouchable numbers of second kind: numbers n such that usigma(x) = n has no solution, where usigma(x) (A034448) is the sum of unitary divisors of x.A064000
Unitary untouchable numbers of second kind: numbers n such that usigma(x) = n has no solution, where usigma(x) (A034448) is the sum of unitary divisors of x.
- Odd abundant numbers not divisible by 5.A064001
Odd abundant numbers not divisible by 5.
- List pairs (i,j) with 1 <= i <= j in colexicographic order: (1,1), (1,2), (2,2), (1,3), (2,3), (3,3), (1,4), ... Let a(1) = 1. Then for n>=2 if the (n-1)-st pair is (i,j) then a(n) = a(i) + a(j) + 1.A064002
List pairs (i,j) with 1 <= i <= j in colexicographic order: (1,1), (1,2), (2,2), (1,3), (2,3), (3,3), (1,4), ... Let a(1) = 1. Then for n>=2 if the (n-1)-st pair is (i,j) then a(n) = a(i) + a(j) + 1.
- Numbers whose product of decimal digits equals its sum of binary digits.A064003
Numbers whose product of decimal digits equals its sum of binary digits.
- At step n in computing A064413, sequence gives smallest multiple of 2 not yet seen, divided by 2.A064004
At step n in computing A064413, sequence gives smallest multiple of 2 not yet seen, divided by 2.
- Erroneous version of A000430.A064005
Erroneous version of A000430.
- Erroneous version of A008318.A064006
Erroneous version of A008318.
- At step n in computing A064413, sequence gives smallest multiple of 3 not yet seen, divided by 3.A064007
At step n in computing A064413, sequence gives smallest multiple of 3 not yet seen, divided by 3.
- a(n) = (10^n - 1)/9*prime(n).A064008
a(n) = (10^n - 1)/9*prime(n).
- a(n) = Sum_{k=1..n} d(k)*prime(k), where d(k) = A001223.A064009
a(n) = Sum_{k=1..n} d(k)*prime(k), where d(k) = A001223.
- Numbers k such that sopf(k) = d(k) where d(k) = A001223(k) and sopf(k) = A008472(k).A064010
Numbers k such that sopf(k) = d(k) where d(k) = A001223(k) and sopf(k) = A008472(k).