Sequences
392,541 sequences
- Reciprocal of n terminates with an infinite repetition of digit 2. Multiples of 10 are omitted.A064561
Reciprocal of n terminates with an infinite repetition of digit 2. Multiples of 10 are omitted.
- Reciprocal of n terminates with an infinite repetition of digit 3. Multiples of 10 are omitted.A064562
Reciprocal of n terminates with an infinite repetition of digit 3. Multiples of 10 are omitted.
- Reciprocal of n terminates with an infinite repetition of digit 4. Multiples of 10 are omitted.A064563
Reciprocal of n terminates with an infinite repetition of digit 4. Multiples of 10 are omitted.
- Reciprocal of n terminates with an infinite repetition of digit 5. Multiples of 10 are omitted.A064564
Reciprocal of n terminates with an infinite repetition of digit 5. Multiples of 10 are omitted.
- Reciprocal of n terminates with an infinite repetition of digit 6. Multiples of 10 are omitted.A064565
Reciprocal of n terminates with an infinite repetition of digit 6. Multiples of 10 are omitted.
- Reciprocal of n terminates with an infinite repetition of digit 7. Multiples of 10 are omitted.A064566
Reciprocal of n terminates with an infinite repetition of digit 7. Multiples of 10 are omitted.
- Reciprocal of n terminates with an infinite repetition of digit 8. Multiples of 10 are omitted.A064567
Reciprocal of n terminates with an infinite repetition of digit 8. Multiples of 10 are omitted.
- n-th term in Recamán's sequence A005132 is divisible by n.A064568
n-th term in Recamán's sequence A005132 is divisible by n.
- Quotients A005132(k)/k for k=A064568(n).A064569
Quotients A005132(k)/k for k=A064568(n).
- Binomial transform of (2n)!.A064570
Binomial transform of (2n)!.
- Binomial transform of (3n)!.A064571
Binomial transform of (3n)!.
- Number of ways to partition n into parts which are all powers of some integer k.A064572
Number of ways to partition n into parts which are all powers of some integer k.
- Number of partitions of n into parts which are all powers of the same prime.A064573
Number of partitions of n into parts which are all powers of the same prime.
- Number of partitions of n into parts which are all powers of the same composite.A064574
Number of partitions of n into parts which are all powers of the same composite.
- First differences of A064572, where A064572(n) is the number of ways to partition n into parts which are all powers of some integer.A064575
First differences of A064572, where A064572(n) is the number of ways to partition n into parts which are all powers of some integer.
- First differences of A064573, where A064573(n) is the number of partitions of n into parts which are all powers of the same prime.A064576
First differences of A064573, where A064573(n) is the number of partitions of n into parts which are all powers of the same prime.
- First differences of A064574.A064577
First differences of A064574.
- Inverse permutation to A057027.A064578
Inverse permutation to A057027.
- Inverse permutation to A054082.A064579
Inverse permutation to A054082.
- Triangle associated with rooted trees with a degree constraint (A036765).A064580
Triangle associated with rooted trees with a degree constraint (A036765).
- Duplicate of A064580.A064581
Duplicate of A064580.
- Real half-period for the Weierstrass elliptic function with invariants g2=0, g3=1.A064582
Real half-period for the Weierstrass elliptic function with invariants g2=0, g3=1.
- a(n) = n^4*(n^4+1)*(n^2-1).A064583
a(n) = n^4*(n^4+1)*(n^2-1).
- Order of twisted group 2G2(3^(2*n + 1)).A064584
Order of twisted group 2G2(3^(2*n + 1)).
- a(n) = n^24*(n^2-1)*(n^6+1)*(n^8-1)*(n^12+1).A064585
a(n) = n^24*(n^2-1)*(n^6+1)*(n^8-1)*(n^12+1).
- Order of twisted group 2F4(2^(2*n + 1)).A064586
Order of twisted group 2F4(2^(2*n + 1)).
- a(n) = n^6*(n^4 + n^2 + 1)*(n^3 - 1)*(n - 1).A064587
a(n) = n^6*(n^4 + n^2 + 1)*(n^3 - 1)*(n - 1).
- a(n) = (2^n)^12*((2^n)^2-1)*((2^n)^6-1)*((2^n)^8 + (2^n)^4+1).A064588
a(n) = (2^n)^12*((2^n)^2-1)*((2^n)^6-1)*((2^n)^8 + (2^n)^4+1).
- a(n) = (3^n)^12*((3^n)^2-1)*((3^n)^6-1)*((3^n)^8 + (3^n)^4+1).A064589
a(n) = (3^n)^12*((3^n)^2-1)*((3^n)^6-1)*((3^n)^8 + (3^n)^4+1).
- Ordered values of A064494.A064590
Ordered values of A064494.
- Nonunitary perfect numbers: k is the sum of its nonunitary divisors; i.e., k = sigma(k) - usigma(k).A064591
Nonunitary perfect numbers: k is the sum of its nonunitary divisors; i.e., k = sigma(k) - usigma(k).
- Nonunitary doubly perfect numbers: the sum of the nonunitary divisors of n is 2n; i.e., sigma(n) - usigma(n) = 2n.A064592
Nonunitary doubly perfect numbers: the sum of the nonunitary divisors of n is 2n; i.e., sigma(n) - usigma(n) = 2n.
- Nonunitary triply perfect numbers: the sum of the nonunitary divisors of n is 3n; i.e., sigma(n) - usigma(n) = 3n.A064593
Nonunitary triply perfect numbers: the sum of the nonunitary divisors of n is 3n; i.e., sigma(n) - usigma(n) = 3n.
- Nonunitary multiply perfect numbers: the sum of the nonunitary divisors of n is a multiple of n; i.e., n divides sigma(n) - usigma(n).A064594
Nonunitary multiply perfect numbers: the sum of the nonunitary divisors of n is a multiple of n; i.e., n divides sigma(n) - usigma(n).
- Nontrivial nonunitary multiply perfect numbers: the sum of the nonunitary divisors of n is a positive multiple of n; i.e., (sigma(n) - usigma(n))/n is a positive integer.A064595
Nontrivial nonunitary multiply perfect numbers: the sum of the nonunitary divisors of n is a positive multiple of n; i.e., (sigma(n) - usigma(n))/n is a positive integer.
- Smallest nonunitary multiperfect number of index n; i.e., smallest k such that sigma(k) - usigma(k) = nk.A064596
Smallest nonunitary multiperfect number of index n; i.e., smallest k such that sigma(k) - usigma(k) = nk.
- Nonunitary abundant numbers: the sum of the nonunitary divisors of k is larger than k; i.e., sigma(k) - usigma(k) > k.A064597
Nonunitary abundant numbers: the sum of the nonunitary divisors of k is larger than k; i.e., sigma(k) - usigma(k) > k.
- Nonunitary deficient numbers: the sum of the nonunitary divisors of n is less than n; i.e., sigma(n) - usigma(n) < n.A064598
Nonunitary deficient numbers: the sum of the nonunitary divisors of n is less than n; i.e., sigma(n) - usigma(n) < n.
- Numbers k such that the sum of the nonunitary divisors of k is a divisor of k; i.e., sigma(k) - usigma(k) divides k.A064599
Numbers k such that the sum of the nonunitary divisors of k is a divisor of k; i.e., sigma(k) - usigma(k) divides k.
- a(n) indicates the position of 5 after n iterations of A064553.A064600
a(n) indicates the position of 5 after n iterations of A064553.
- a(n) = # { p | A064558(k) = p prime and k <= n}.A064601
a(n) = # { p | A064558(k) = p prime and k <= n}.
- Partial sums of A001157: Sum_{j=1..n} sigma_2(j).A064602
Partial sums of A001157: Sum_{j=1..n} sigma_2(j).
- Partial sums of A001158: Sum_{j=1..n} sigma_3(j).A064603
Partial sums of A001158: Sum_{j=1..n} sigma_3(j).
- Partial sums of A001159: Sum_{j=1..n} sigma_4(j).A064604
Partial sums of A001159: Sum_{j=1..n} sigma_4(j).
- Numbers k such that A064602(k) is divisible by k.A064605
Numbers k such that A064602(k) is divisible by k.
- Numbers k such that A064603(k) is divisible by k.A064606
Numbers k such that A064603(k) is divisible by k.
- Numbers k such that A064604(k) is divisible by k.A064607
Numbers k such that A064604(k) is divisible by k.
- Partial sums of A034444: sum of number of unitary divisors from 1 to n.A064608
Partial sums of A034444: sum of number of unitary divisors from 1 to n.
- Partial sums of A034448: sum of unitary divisors from 1 to n.A064609
Partial sums of A034448: sum of unitary divisors from 1 to n.
- Places k where A064608(k) (partial sums of unitary tau) is divisible by k.A064610
Places k where A064608(k) (partial sums of unitary tau) is divisible by k.