Sequences
392,541 sequences
- Least abundant number divisible by the n-th prime number.A064161
Least abundant number divisible by the n-th prime number.
- Least abundant number divisible by n.A064162
Least abundant number divisible by n.
- Theta series of the 71-dimensional sublattice orthogonal to a norm 8 vector of the putative extremal 72-dimensional even unimodular lattice.A064163
Theta series of the 71-dimensional sublattice orthogonal to a norm 8 vector of the putative extremal 72-dimensional even unimodular lattice.
- EHS numbers: k such that there is a prime p satisfying k! + 1 == 0 (mod p) and p !== 1 (mod k).A064164
EHS numbers: k such that there is a prime p satisfying k! + 1 == 0 (mod p) and p !== 1 (mod k).
- a(n) = tau( sigma_n(n) ), where tau is the number of divisors of n.A064165
a(n) = tau( sigma_n(n) ), where tau is the number of divisors of n.
- Composite numbers the sum of the digits in the prime factors of which, with repetition, is prime.A064166
Composite numbers the sum of the digits in the prime factors of which, with repetition, is prime.
- Product of numerator and denominator of the n-th harmonic number, 1 + 1/2 + 1/3 +...+ 1/n.A064167
Product of numerator and denominator of the n-th harmonic number, 1 + 1/2 + 1/3 +...+ 1/n.
- Sum of numerator and denominator in n-th harmonic number, 1 + 1/2 + 1/3 +...+ 1/n.A064168
Sum of numerator and denominator in n-th harmonic number, 1 + 1/2 + 1/3 +...+ 1/n.
- Numerator - denominator in n-th harmonic number, 1 + 1/2 + 1/3 + ... + 1/n.A064169
Numerator - denominator in n-th harmonic number, 1 + 1/2 + 1/3 + ... + 1/n.
- a(1) = 1; a(n+1) = product of numerator and denominator in Sum_{k=1..n} 1/a(k).A064170
a(1) = 1; a(n+1) = product of numerator and denominator in Sum_{k=1..n} 1/a(k).
- a(1) = 1; a(n+1) = product of numerator and denominator of the continued fraction, [a(1); a(2), a(3),..., a(n)].A064171
a(1) = 1; a(n+1) = product of numerator and denominator of the continued fraction, [a(1); a(2), a(3),..., a(n)].
- Koechel numbers of Mozart's piano concerti, from the original Koechel catalog.A064172
Koechel numbers of Mozart's piano concerti, from the original Koechel catalog.
- Number of partitions of n with positive rank.A064173
Number of partitions of n with positive rank.
- Number of partitions of n with nonnegative rank.A064174
Number of partitions of n with nonnegative rank.
- Duplicate of A000028.A064175
Duplicate of A000028.
- Duplicate of A000379.A064176
Duplicate of A000379.
- Erroneous version of A007666.A064177
Erroneous version of A007666.
- Determinant transform of sequence {pi(m)} = A000720.A064178
Determinant transform of sequence {pi(m)} = A000720.
- Infinitary version of Moebius function: infinitary MoebiusMu of n, equal to mu(n) iff mu(n) differs from zero, else 1 or -1 depending on whether the sum of the binary digits of the exponents in the prime decomposition of n is even or odd.A064179
Infinitary version of Moebius function: infinitary MoebiusMu of n, equal to mu(n) iff mu(n) differs from zero, else 1 or -1 depending on whether the sum of the binary digits of the exponents in the prime decomposition of n is even or odd.
- Composite numbers k such that the sum of the proper divisors of k not including 1, (Chowla's function, A048050) and their product (A007956) are both perfect squares.A064180
Composite numbers k such that the sum of the proper divisors of k not including 1, (Chowla's function, A048050) and their product (A007956) are both perfect squares.
- Smallest number that can be written in n ways as an unordered sum of 3 nonzero triangular numbers.A064181
Smallest number that can be written in n ways as an unordered sum of 3 nonzero triangular numbers.
- Sum_{k <= 10^n} number of distinct primes dividing k (A001221).A064182
Sum_{k <= 10^n} number of distinct primes dividing k (A001221).
- Define a pair of sequences by p(0) = 0, q(0) = p(1) = q(1) = 1, q(n+1) = p(n)*q(n-1), p(n+1) = q(n+1) + q(n) for n > 0; then a(n) = q(n) and A064526(n) = p(n).A064183
Define a pair of sequences by p(0) = 0, q(0) = p(1) = q(1) = 1, q(n+1) = p(n)*q(n-1), p(n+1) = q(n+1) + q(n) for n > 0; then a(n) = q(n) and A064526(n) = p(n).
- Denominator of sequence defined by recursion c(n)=1+c(n-2)/c(n-1), c(0)=0, c(1)=1.A064184
Denominator of sequence defined by recursion c(n)=1+c(n-2)/c(n-1), c(0)=0, c(1)=1.
- a(n) = (b(n+3) * b(n-1) * a(n-1)^2 - 1) / b(n+2) where b(n) = A006720(n).A064185
a(n) = (b(n+3) * b(n-1) * a(n-1)^2 - 1) / b(n+2) where b(n) = A006720(n).
- Numbers n such that n!+1 and n!-1 have the same number of prime divisors (with repetition).A064186
Numbers n such that n!+1 and n!-1 have the same number of prime divisors (with repetition).
- First of n^2 consecutive odd primes whose sum (=S) is divisible by n and S/n == n (mod 2).A064187
First of n^2 consecutive odd primes whose sum (=S) is divisible by n and S/n == n (mod 2).
- a(n) = Sum_{k=0..floor(n/2)} binomial(n - k*(k-1)/2, k).A064188
a(n) = Sum_{k=0..floor(n/2)} binomial(n - k*(k-1)/2, k).
- Triangle T(n,k), 0 <= k <= n, read by rows, defined by: T(0,0)=1, T(n,k)=0 if n < k, T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n-1,k+1).A064189
Triangle T(n,k), 0 <= k <= n, read by rows, defined by: T(0,0)=1, T(n,k)=0 if n < k, T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n-1,k+1).
- Triangle T(n,k) generalizing the tangent numbers.A064190
Triangle T(n,k) generalizing the tangent numbers.
- Triangle T(n,k) (n >= 0, 0 <= k <= n) generalizing Motzkin numbers.A064191
Triangle T(n,k) (n >= 0, 0 <= k <= n) generalizing Motzkin numbers.
- Triangle in which rows are permutations of the rows of A008282.A064192
Triangle in which rows are permutations of the rows of A008282.
- Numbers whose product of divisors and sum of unitary divisors are both squares.A064193
Numbers whose product of divisors and sum of unitary divisors are both squares.
- a(2n) = 3*a(n), a(2n+1) = 2*a(n+1)+a(n), with a(1) = 1.A064194
a(2n) = 3*a(n), a(2n+1) = 2*a(n+1)+a(n), with a(1) = 1.
- a(n) = 3*(n-2)*(n-3)*(3*n^2-9)*(3*n^2-9*n-5)/2.A064195
a(n) = 3*(n-2)*(n-3)*(3*n^2-9)*(3*n^2-9*n-5)/2.
- Duplicate of A060786.A064196
Duplicate of A060786.
- a(n) = 27*(n-1)*(n-2)*(n-3)*(3*n-8)/2.A064197
a(n) = 27*(n-1)*(n-2)*(n-3)*(3*n-8)/2.
- a(n) = 3*(n-2)*(n-3)*(3*n^2-3*n-8)/2.A064198
a(n) = 3*(n-2)*(n-3)*(3*n^2-3*n-8)/2.
- a(n) = 9*(n-2)^2*(n^2-2*n-1)/2.A064199
a(n) = 9*(n-2)^2*(n^2-2*n-1)/2.
- a(n) = 12*n*(n-1).A064200
a(n) = 12*n*(n-1).
- 9 times octagonal numbers: a(n) = 9*n*(3*n-2).A064201
9 times octagonal numbers: a(n) = 9*n*(3*n-2).
- a(n) = n*(n+1)*(n+2)*(2*n^3 + 6*n^2 + 7*n - 3)/36.A064202
a(n) = n*(n+1)*(n+2)*(2*n^3 + 6*n^2 + 7*n - 3)/36.
- a(n) = n*(n^2 - 1)*(n+2)*(2*n^5 + 14*n^4 + 49*n^3 + 91*n^2 + 90*n + 18)/324.A064203
a(n) = n*(n^2 - 1)*(n+2)*(2*n^5 + 14*n^4 + 49*n^3 + 91*n^2 + 90*n + 18)/324.
- a(n) = 280*binomial(n+4,9) + 280*binomial(n+4,8) + 105*binomial(n+3,7) + 77*binomial(n+3,6) + 43*binomial(n+2,5) - 16*binomial(n+2,4) + 20*binomial(n+1,3) - floor(n*(n^2 - 1)*(n^2 - 4)*(n-3)/360).A064204
a(n) = 280*binomial(n+4,9) + 280*binomial(n+4,8) + 105*binomial(n+3,7) + 77*binomial(n+3,6) + 43*binomial(n+2,5) - 16*binomial(n+2,4) + 20*binomial(n+1,3) - floor(n*(n^2 - 1)*(n^2 - 4)*(n-3)/360).
- Numbers k such that sigma(k) + tau(k) is a prime.A064205
Numbers k such that sigma(k) + tau(k) is a prime.
- Inverse of sequence A004484 considered as a permutation of the nonnegative integers.A064206
Inverse of sequence A004484 considered as a permutation of the nonnegative integers.
- Inverse of sequence A004485 considered as a permutation of the nonnegative integers.A064207
Inverse of sequence A004485 considered as a permutation of the nonnegative integers.
- Inverse of sequence A004486 considered as a permutation of the nonnegative integers.A064208
Inverse of sequence A004486 considered as a permutation of the nonnegative integers.
- Numbers k whose sum of digits exceeds the sum of the digits of k^3.A064209
Numbers k whose sum of digits exceeds the sum of the digits of k^3.
- Numbers n such that sum of the digits of n is >= the sum of the digits of n^4.A064210
Numbers n such that sum of the digits of n is >= the sum of the digits of n^4.