Sequences
392,541 sequences
- Odd numbers less than the cube of their number of divisors.A056761
Odd numbers less than the cube of their number of divisors.
- Number of terms in A056761 (i.e., odd numbers from A056757) between 2^(n-1) and 2^n.A056762
Number of terms in A056761 (i.e., odd numbers from A056757) between 2^(n-1) and 2^n.
- Number of integers in the range (2^(n-1), 2^n] for which d(k)^3 > k holds, i.e., the cube of the number of divisors of k exceeds the number k.A056763
Number of integers in the range (2^(n-1), 2^n] for which d(k)^3 > k holds, i.e., the cube of the number of divisors of k exceeds the number k.
- Number of integers k not exceeding 2^n such that the cube of number of divisors [A000005(k)] is larger than k.A056764
Number of integers k not exceeding 2^n such that the cube of number of divisors [A000005(k)] is larger than k.
- Number of integers from A056757 (defined by A000005(x)^3 > x) not exceeding 2^n.A056765
Number of integers from A056757 (defined by A000005(x)^3 > x) not exceeding 2^n.
- Smallest term of A056757 (numbers for which the cube of the number of divisors exceeds the number) between 2^(n-1) and 2^n.A056766
Smallest term of A056757 (numbers for which the cube of the number of divisors exceeds the number) between 2^(n-1) and 2^n.
- Largest number of binary size n (i.e., between (n-1)-th and n-th powers of 2) with the following property: cube of its number of divisors is larger than the number itself.A056767
Largest number of binary size n (i.e., between (n-1)-th and n-th powers of 2) with the following property: cube of its number of divisors is larger than the number itself.
- Number of partitions of the n-th prime into parts that are all primes.A056768
Number of partitions of the n-th prime into parts that are all primes.
- Puzzle 2, related to polyominoes.A056769
Puzzle 2, related to polyominoes.
- Smallest number that is n times the product of its digits or 0 if impossible.A056770
Smallest number that is n times the product of its digits or 0 if impossible.
- a(n) = a(-n) = 34*a(n-1) - a(n-2), and a(0)=1, a(1)=17.A056771
a(n) = a(-n) = 34*a(n-1) - a(n-2), and a(0)=1, a(1)=17.
- Numbers k such that phi(k+4) = phi(k) + 4, where phi(k) = A000010(k) is Euler's totient function.A056772
Numbers k such that phi(k+4) = phi(k) + 4, where phi(k) = A000010(k) is Euler's totient function.
- Composite n such that phi(n+4) = phi(n)+4.A056773
Composite n such that phi(n+4) = phi(n)+4.
- Composite n such that phi(n+2) = phi(n)+2.A056774
Composite n such that phi(n+2) = phi(n)+2.
- Numbers k such that phi(k+12) = phi(k) + 12.A056775
Numbers k such that phi(k+12) = phi(k) + 12.
- Composite numbers k such that phi(k+12) = phi(k) + 12.A056776
Composite numbers k such that phi(k+12) = phi(k) + 12.
- Composite numbers k such that both phi(k+12) = phi(k) + 12 and sigma(k+12) = sigma(k) + 12.A056777
Composite numbers k such that both phi(k+12) = phi(k) + 12 and sigma(k+12) = sigma(k) + 12.
- Number of 3-element antichains on an unlabeled n-element set; equivalence classes of monotone Boolean functions of n variables with 3 mincuts under action of symmetric group S_n.A056778
Number of 3-element antichains on an unlabeled n-element set; equivalence classes of monotone Boolean functions of n variables with 3 mincuts under action of symmetric group S_n.
- Number of poly-IH73-tiles (holes allowed) with n cells.A056779
Number of poly-IH73-tiles (holes allowed) with n cells.
- Rectangular free polyominoes: number of n-celled polyominoes when the cell is a rectangle.A056780
Rectangular free polyominoes: number of n-celled polyominoes when the cell is a rectangle.
- Prime powers such that the 4th power of the number of divisors is not smaller than the number itself.A056781
Prime powers such that the 4th power of the number of divisors is not smaller than the number itself.
- Number of 3-element proper antichains (i.e., antichains such that every two members have nonempty intersection) on an unlabeled n-element set.A056782
Number of 3-element proper antichains (i.e., antichains such that every two members have nonempty intersection) on an unlabeled n-element set.
- Number of diamond polyominoes with n cells.A056783
Number of diamond polyominoes with n cells.
- First nonprime in a sequence of consecutive nonprimes which is at least twice as long as any earlier run of consecutive nonprimes in this list.A056784
First nonprime in a sequence of consecutive nonprimes which is at least twice as long as any earlier run of consecutive nonprimes in this list.
- Number of polydominoes.A056785
Number of polydominoes.
- Number of inequivalent connected planar figures that can be formed from n non-overlapping 1 X 2 rectangles (or dominoes).A056786
Number of inequivalent connected planar figures that can be formed from n non-overlapping 1 X 2 rectangles (or dominoes).
- Number of incongruental unlabeled undirected trees with n nodes on a square lattice and edges of length 1 or sqrt(2) admitted to the 4 nearest or 4 2nd nearest neighbors.A056787
Number of incongruental unlabeled undirected trees with n nodes on a square lattice and edges of length 1 or sqrt(2) admitted to the 4 nearest or 4 2nd nearest neighbors.
- a(n) = n^n + (n-1)^(n-1).A056788
a(n) = n^n + (n-1)^(n-1).
- a(n) = Sum_{k=1..n} lcm(k,n)/gcd(k,n).A056789
a(n) = Sum_{k=1..n} lcm(k,n)/gcd(k,n).
- Greatest prime factor of n^n + (n+1)^(n+1).A056790
Greatest prime factor of n^n + (n+1)^(n+1).
- Weight of binary expansion of n + length of binary expansion of n.A056791
Weight of binary expansion of n + length of binary expansion of n.
- Minimal number of steps to get from 0 to n by (a) adding 1 or (b) multiplying by 2.A056792
Minimal number of steps to get from 0 to n by (a) adding 1 or (b) multiplying by 2.
- Number of divisors of lcm(1..n).A056793
Number of divisors of lcm(1..n).
- Numbers n such that n*(n-1) is an oblong (promic, A002378) palindrome.A056794
Numbers n such that n*(n-1) is an oblong (promic, A002378) palindrome.
- Number of divisors of k as k runs through sequence of distinct values of LCM(1,..,n).A056795
Number of divisors of k as k runs through sequence of distinct values of LCM(1,..,n).
- Minimal number of steps to get from 0 to n when there are 3 kinds of step: add 1, multiply by 2, multiply by 3.A056796
Minimal number of steps to get from 0 to n when there are 3 kinds of step: add 1, multiply by 2, multiply by 3.
- Numbers k such that 9*10^k+1 is prime.A056797
Numbers k such that 9*10^k+1 is prime.
- Prime powers with even nonnegative exponents.A056798
Prime powers with even nonnegative exponents.
- Numbers n such that 8*9^n +1 is prime.A056799
Numbers n such that 8*9^n +1 is prime.
- Numbers n such that 6*9^n +1 is prime.A056800
Numbers n such that 6*9^n +1 is prime.
- Numbers k such that 4*9^k + 1 is prime.A056801
Numbers k such that 4*9^k + 1 is prime.
- Numbers k such that 2*9^k + 1 is prime.A056802
Numbers k such that 2*9^k + 1 is prime.
- Numbers k such that k copies of 12 followed by 1 is a palindromic prime.A056803
Numbers k such that k copies of 12 followed by 1 is a palindromic prime.
- Numbers k such that 7*10^k + 1 is prime.A056804
Numbers k such that 7*10^k + 1 is prime.
- Numbers k such that 6*10^k+1 is prime.A056805
Numbers k such that 6*10^k+1 is prime.
- Numbers n such that 4*10^n + 1 is prime.A056806
Numbers n such that 4*10^n + 1 is prime.
- Numbers k such that 3*10^k + 1 is prime.A056807
Numbers k such that 3*10^k + 1 is prime.
- Members of A055932 which are not least prime signatures (cf. A025487).A056808
Members of A055932 which are not least prime signatures (cf. A025487).
- Numbers k such that k, k+1 and k+2 are products of two primes.A056809
Numbers k such that k, k+1 and k+2 are products of two primes.
- Numbers whose fourth power is a palindrome.A056810
Numbers whose fourth power is a palindrome.