Sequences
392,541 sequences
- Largest number that is equal to sum of n-th powers of its digits.A046761
Largest number that is equal to sum of n-th powers of its digits.
- Numbers k such that the sum of the squares of the divisors of k is divisible by k.A046762
Numbers k such that the sum of the squares of the divisors of k is divisible by k.
- Numbers that divide the sum of cubes of their divisors.A046763
Numbers that divide the sum of cubes of their divisors.
- Sum of the 4th powers of the divisors of n is divisible by n.A046764
Sum of the 4th powers of the divisors of n is divisible by n.
- Number of partitions of n with equal number of parts congruent to each of 0, 1 and 2 (mod 3).A046765
Number of partitions of n with equal number of parts congruent to each of 0, 1 and 2 (mod 3).
- Number of partitions of n with equal number of parts congruent to each of 0, 1 and 2 (mod 4).A046766
Number of partitions of n with equal number of parts congruent to each of 0, 1 and 2 (mod 4).
- Number of partitions of n with equal number of parts congruent to each of 0, 1 and 3 (mod 4).A046767
Number of partitions of n with equal number of parts congruent to each of 0, 1 and 3 (mod 4).
- Number of partitions of n with equal number of parts congruent to each of 0, 2 and 3 (mod 4).A046768
Number of partitions of n with equal number of parts congruent to each of 0, 2 and 3 (mod 4).
- Number of partitions of n with equal number of parts congruent to each of 1, 2 and 3 (mod 4).A046769
Number of partitions of n with equal number of parts congruent to each of 1, 2 and 3 (mod 4).
- Number of partitions of n with equal number of parts congruent to each of 0, 1, 2 and 3 (mod 4).A046770
Number of partitions of n with equal number of parts congruent to each of 0, 1, 2 and 3 (mod 4).
- Number of partitions of n with equal number of parts congruent to each of 0, 1, 2 and 3 (mod 5).A046771
Number of partitions of n with equal number of parts congruent to each of 0, 1, 2 and 3 (mod 5).
- Number of partitions of n with equal number of parts congruent to each of 0, 1, 2 and 4 (mod 5).A046772
Number of partitions of n with equal number of parts congruent to each of 0, 1, 2 and 4 (mod 5).
- Number of partitions of n with equal number of parts congruent to each of 0, 1, 3 and 4 (mod 5).A046773
Number of partitions of n with equal number of parts congruent to each of 0, 1, 3 and 4 (mod 5).
- Number of partitions of n with equal number of parts congruent to each of 0, 2, 3 and 4 (mod 5).A046774
Number of partitions of n with equal number of parts congruent to each of 0, 2, 3 and 4 (mod 5).
- Number of partitions of n with equal number of parts congruent to each of 1, 2, 3 and 4 (mod 5).A046775
Number of partitions of n with equal number of parts congruent to each of 1, 2, 3 and 4 (mod 5).
- Number of partitions of 5n with equal number of parts congruent to each of 0, 1, 2, 3 and 4 (mod 5).A046776
Number of partitions of 5n with equal number of parts congruent to each of 0, 1, 2, 3 and 4 (mod 5).
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1 and 2 (mod 3).A046777
Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1 and 2 (mod 3).
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1 and 2 (mod 4).A046778
Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1 and 2 (mod 4).
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1 and 3 (mod 4).A046779
Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1 and 3 (mod 4).
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 2 and 3 (mod 4).A046780
Number of partitions of n with equal nonzero number of parts congruent to each of 0, 2 and 3 (mod 4).
- Number of partitions of n with equal nonzero number of parts congruent to each of 1, 2 and 3 (mod 4).A046781
Number of partitions of n with equal nonzero number of parts congruent to each of 1, 2 and 3 (mod 4).
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1, 2 and 3 (mod 4).A046782
Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1, 2 and 3 (mod 4).
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1, 2 and 3 (mod 5).A046783
Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1, 2 and 3 (mod 5).
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1, 2 and 4 (mod 5).A046784
Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1, 2 and 4 (mod 5).
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1, 3 and 4 (mod 5).A046785
Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1, 3 and 4 (mod 5).
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 2, 3 and 4 (mod 5).A046786
Number of partitions of n with equal nonzero number of parts congruent to each of 0, 2, 3 and 4 (mod 5).
- Number of partitions of 5n with equal nonzero number of parts congruent to each of 1, 2, 3 and 4 modulo 5.A046787
Number of partitions of 5n with equal nonzero number of parts congruent to each of 1, 2, 3 and 4 modulo 5.
- Configurations of linear chains in a 4-dimensional hypercubic lattice.A046788
Configurations of linear chains in a 4-dimensional hypercubic lattice.
- Lower prime of the second gap of 2n between primes.A046789
Lower prime of the second gap of 2n between primes.
- Positive numbers divisible by 8 or by the square of an odd prime.A046790
Positive numbers divisible by 8 or by the square of an odd prime.
- A046790 has several definitions, one of which is: "Numbers i such that there is a smaller positive number j such that (i+j)/2 and sqrt(i*j) are integers". The present sequence gives the smallest choice for j.A046791
A046790 has several definitions, one of which is: "Numbers i such that there is a smaller positive number j such that (i+j)/2 and sqrt(i*j) are integers". The present sequence gives the smallest choice for j.
- Triangle of numbers where k-th row contains (ij)!/(i!j!) with i+j = k+1, 1 <= i <= k.A046792
Triangle of numbers where k-th row contains (ij)!/(i!j!) with i+j = k+1, 1 <= i <= k.
- Numbers n such that arithmetic and harmonic means of a(n) and A005279(n) both integers.A046793
Numbers n such that arithmetic and harmonic means of a(n) and A005279(n) both integers.
- Geometric and harmonic means of A046795(n) and a(n) both integers.A046794
Geometric and harmonic means of A046795(n) and a(n) both integers.
- Geometric and harmonic means of a(n) and A046794(n) both integers.A046795
Geometric and harmonic means of a(n) and A046794(n) both integers.
- Arithmetic, geometric and harmonic means of A046797(n) and a(n) all integers.A046796
Arithmetic, geometric and harmonic means of A046797(n) and a(n) all integers.
- Arithmetic, geometric and harmonic means of a(n) and A046796(n) all integers.A046797
Arithmetic, geometric and harmonic means of a(n) and A046796(n) all integers.
- Number of divisors of 2^n + 1.A046798
Number of divisors of 2^n + 1.
- Number of distinct prime factors of 2^n+1.A046799
Number of distinct prime factors of 2^n+1.
- Number of distinct prime factors of 2^n-1.A046800
Number of distinct prime factors of 2^n-1.
- Number of divisors of 2^n-1.A046801
Number of divisors of 2^n-1.
- T(n, k) = Sum_{j=k..n} binomial(n, j)*E1(j, j-k), where E1 are the Eulerian numbers A173018. Triangle read by rows, T(n, k) for 0 <= k <= n.A046802
T(n, k) = Sum_{j=k..n} binomial(n, j)*E1(j, j-k), where E1 are the Eulerian numbers A173018. Triangle read by rows, T(n, k) for 0 <= k <= n.
- Triangle of numbers related to Eulerian numbers.A046803
Triangle of numbers related to Eulerian numbers.
- a(n) = p mod (p mod 10) where p = prime(n).A046804
a(n) = p mod (p mod 10) where p = prime(n).
- If n=sum a_i b_i, (a_i,b_i positive integers) then a(n)=max value of min(all a_i and b_i).A046805
If n=sum a_i b_i, (a_i,b_i positive integers) then a(n)=max value of min(all a_i and b_i).
- Largest number m with A046805(m) = n.A046806
Largest number m with A046805(m) = n.
- Palindromes in factorial base.A046807
Palindromes in factorial base.
- a(n) is the least integer greater than a(n-1) such that a(n-1)*2^a(n) + 1 is prime, a(1) = 1.A046808
a(n) is the least integer greater than a(n-1) such that a(n-1)*2^a(n) + 1 is prime, a(1) = 1.
- a(n) is the least integer greater than a(n-1) such that a(n-1)*2^a(n) - 1 is prime, a(1) = 1.A046809
a(n) is the least integer greater than a(n-1) such that a(n-1)*2^a(n) - 1 is prime, a(1) = 1.
- Number of anagrams of n that are primes.A046810
Number of anagrams of n that are primes.