Sequences
392,541 sequences
- a(n) = Sum_{j=0..n} (2*n)!/(2*n-j)!.A066211
a(n) = Sum_{j=0..n} (2*n)!/(2*n-j)!.
- A measure of how close the golden ratio is to rational numbers.A066212
A measure of how close the golden ratio is to rational numbers.
- Numbers which are sums of squares of some subset of divisors.A066213
Numbers which are sums of squares of some subset of divisors.
- Nonsquare numbers which are sums of squares of some subset of divisors.A066214
Nonsquare numbers which are sums of squares of some subset of divisors.
- Numbers which are sums of cubes of some subset of divisors.A066215
Numbers which are sums of cubes of some subset of divisors.
- Noncube numbers which are sums of cubes of some subset of divisors.A066216
Noncube numbers which are sums of cubes of some subset of divisors.
- Numbers not ending in 0 which are the product of two substrings of themselves. The substrings may be equal, but each must be greater than 1.A066217
Numbers not ending in 0 which are the product of two substrings of themselves. The substrings may be equal, but each must be greater than 1.
- Numbers k such that sigma(k) = Sum_{j|k, j<k} sigma(j).A066218
Numbers k such that sigma(k) = Sum_{j|k, j<k} sigma(j).
- Numbers n such that |phi(n+1)-phi(n)| = |d(n+1)-d(n)|, where phi is Euler's totient function and d(n) = number of divisors of n.A066219
Numbers n such that |phi(n+1)-phi(n)| = |d(n+1)-d(n)|, where phi is Euler's totient function and d(n) = number of divisors of n.
- Least k > 0 such that t^k = 1 mod (prime(n) - t) for 0 < t < prime(n).A066220
Least k > 0 such that t^k = 1 mod (prime(n) - t) for 0 < t < prime(n).
- Bisection of A001189.A066221
Bisection of A001189.
- Bisection of A001189.A066222
Bisection of A001189.
- Bisection of A000085.A066223
Bisection of A000085.
- Bisection of A000085.A066224
Bisection of A000085.
- Covering numbers C(n,n-4,n-5).A066225
Covering numbers C(n,n-4,n-5).
- The sigma(EulerPhi)-perfect numbers, where the set of f-perfect numbers for an arithmetical function f is defined in A066218.A066226
The sigma(EulerPhi)-perfect numbers, where the set of f-perfect numbers for an arithmetical function f is defined in A066218.
- Number of digits in Mersenne primes with a prime number of digits.A066227
Number of digits in Mersenne primes with a prime number of digits.
- The EulerPhi(sigma(EulerPhi))-perfect numbers, where the f-perfect numbers for an arithmetical function f are defined in A066218.A066228
The EulerPhi(sigma(EulerPhi))-perfect numbers, where the f-perfect numbers for an arithmetical function f are defined in A066218.
- f-perfect numbers, where f(m) = m + 1.A066229
f-perfect numbers, where f(m) = m + 1.
- f-perfect numbers, where f(m) = m - 1.A066230
f-perfect numbers, where f(m) = m - 1.
- Numbers n such that phi(n) = phi(n-1) - phi(n-2).A066231
Numbers n such that phi(n) = phi(n-1) - phi(n-2).
- Numbers k such that phi(k) = phi(k-2) - phi(k-1).A066232
Numbers k such that phi(k) = phi(k-2) - phi(k-1).
- Numbers k such that the sum of digits of k^k is a prime.A066233
Numbers k such that the sum of digits of k^k is a prime.
- Theta series of GH39, an extremal unimodular 39-dimensional lattice.A066234
Theta series of GH39, an extremal unimodular 39-dimensional lattice.
- Numbers k such that the sum of digits of k! is a square.A066235
Numbers k such that the sum of digits of k! is a square.
- Numbers k such that the sum of digits of k^k is a square.A066236
Numbers k such that the sum of digits of k^k is a square.
- First differences give A052849.A066237
First differences give A052849.
- The floor(n/3)-perfect numbers, where f-perfect numbers for an arithmetical function f are defined in A066218.A066238
The floor(n/3)-perfect numbers, where f-perfect numbers for an arithmetical function f are defined in A066218.
- The floor(1.001*x)-perfect numbers, where f-perfect numbers for an arithmetical function f are defined in A066218.A066239
The floor(1.001*x)-perfect numbers, where f-perfect numbers for an arithmetical function f are defined in A066218.
- The floor(n/2)-perfect numbers, where f-perfect numbers for an arithmetical function f are defined in A066218.A066240
The floor(n/2)-perfect numbers, where f-perfect numbers for an arithmetical function f are defined in A066218.
- 1 + number of anti-divisors of n.A066241
1 + number of anti-divisors of n.
- The floor((log(x))^2)-perfect numbers, where f-perfect numbers for an arithmetical function f are defined in A066218.A066242
The floor((log(x))^2)-perfect numbers, where f-perfect numbers for an arithmetical function f are defined in A066218.
- Superseded by A063428.A066243
Superseded by A063428.
- Numbers n such that sigma(n+2)-2sigma(n+1)+sigma(n) = n.A066244
Numbers n such that sigma(n+2)-2sigma(n+1)+sigma(n) = n.
- Floor(|x*sin(x)|)-perfect numbers, where f-perfect numbers for an arithmetical function f are defined in A066218.A066245
Floor(|x*sin(x)|)-perfect numbers, where f-perfect numbers for an arithmetical function f are defined in A066218.
- a(n) = 0 unless n is a composite number A002808(k) then a(n) = k.A066246
a(n) = 0 unless n is a composite number A002808(k) then a(n) = k.
- Characteristic function of composite numbers: 1 if n is composite else 0.A066247
Characteristic function of composite numbers: 1 if n is composite else 0.
- a(n) = if n+1 is prime then A049084(n+1)*2 else A066246(n+1)*2 - 1.A066248
a(n) = if n+1 is prime then A049084(n+1)*2 else A066246(n+1)*2 - 1.
- Inverse permutation to A066248.A066249
Inverse permutation to A066248.
- a(n) = if n+1 is prime then A049084(n+1)*2 - 1 else A066246(n+1)*2.A066250
a(n) = if n+1 is prime then A049084(n+1)*2 - 1 else A066246(n+1)*2.
- Inverse permutation to A066250.A066251
Inverse permutation to A066250.
- a(n) = A066248(A066248(n)).A066252
a(n) = A066248(A066248(n)).
- a(n) = A066249(A066249(n)).A066253
a(n) = A066249(A066249(n)).
- a(n) = A066250(A066250(n)).A066254
a(n) = A066250(A066250(n)).
- a(n) = A066251(A066251(n)).A066255
a(n) = A066251(A066251(n)).
- a(n) = k that produces the smallest integer m > 1 of the form m = (k^2 + n)/(n^2 + k).A066256
a(n) = k that produces the smallest integer m > 1 of the form m = (k^2 + n)/(n^2 + k).
- a(n) is the smallest number >1 of the form (k^2+n)/(n^2+k).A066257
a(n) is the smallest number >1 of the form (k^2+n)/(n^2+k).
- a(n) = Fibonacci(n)^2 * Fibonacci(n+1).A066258
a(n) = Fibonacci(n)^2 * Fibonacci(n+1).
- a(n) = Fibonacci(n)*Fibonacci(n+1)^2.A066259
a(n) = Fibonacci(n)*Fibonacci(n+1)^2.
- In the prime factorization of n replace the k-th prime with the k-th composite number, k > 0.A066260
In the prime factorization of n replace the k-th prime with the k-th composite number, k > 0.