Sequences
392,541 sequences
- Sum of divisors of 2^n+1.A069061
Sum of divisors of 2^n+1.
- Numbers k such that k^2-1 and k^2+1 have the same number of positive divisors.A069062
Numbers k such that k^2-1 and k^2+1 have the same number of positive divisors.
- Composite k such that A029939(k) > k*(k+1)/2 where A029939(k) = Sum_{d|k} phi(d)^2.A069063
Composite k such that A029939(k) > k*(k+1)/2 where A029939(k) = Sum_{d|k} phi(d)^2.
- Integers which have at least two different factorizations into coprime parts whose sum are equal.A069064
Integers which have at least two different factorizations into coprime parts whose sum are equal.
- Sigma(n)-phi(n) is a triangular number.A069065
Sigma(n)-phi(n) is a triangular number.
- Sigma(n)+phi(n) is a triangular number.A069066
Sigma(n)+phi(n) is a triangular number.
- Numbers k such that k*tau(k) is a perfect square.A069067
Numbers k such that k*tau(k) is a perfect square.
- Composite numbers k+1 such that k*phi(k+1) is a perfect square.A069068
Composite numbers k+1 such that k*phi(k+1) is a perfect square.
- Numbers n such that n*phi(n-1) is a perfect square.A069069
Numbers n such that n*phi(n-1) is a perfect square.
- Numbers n such that n*sigma(n) is a perfect square.A069070
Numbers n such that n*sigma(n) is a perfect square.
- a(n) = (2*n + 1)*((2*n + 1)^4 + 4).A069071
a(n) = (2*n + 1)*((2*n + 1)^4 + 4).
- a(n) = (2n+1)*(2n+2)*(2n+3).A069072
a(n) = (2n+1)*(2n+2)*(2n+3).
- a(n) = n*(4n^2 - 1)^2.A069073
a(n) = n*(4n^2 - 1)^2.
- a(n) = (2*n+2)*(2*n+3)*(2*n+4) = 24*A000330(n+1).A069074
a(n) = (2*n+2)*(2*n+3)*(2*n+4) = 24*A000330(n+1).
- a(n) = (4*n^2 - 1)^2.A069075
a(n) = (4*n^2 - 1)^2.
- a(n) = (4*n^2 - 1)^3.A069076
a(n) = (4*n^2 - 1)^3.
- Triangular numbers such that the product of digits is also a (positive) triangular number.A069077
Triangular numbers such that the product of digits is also a (positive) triangular number.
- a(n) = n*(4*n^4 + 1).A069078
a(n) = n*(4*n^4 + 1).
- a(n) = (2*n+1)*(2*n+2)*(2*n+4)*(2*n+5).A069079
a(n) = (2*n+1)*(2*n+2)*(2*n+4)*(2*n+5).
- a(n) = (2n+1)*(2n+2)*(2n+6)*(2n+7).A069080
a(n) = (2n+1)*(2n+2)*(2n+6)*(2n+7).
- Numbers n such that sigma(n)/tau(n) has denominator 2.A069081
Numbers n such that sigma(n)/tau(n) has denominator 2.
- Numbers n such that sigma(n)/tau(n) has denominator 3.A069082
Numbers n such that sigma(n)/tau(n) has denominator 3.
- Numbers n such that sigma(n)/tau(n) has denominator 4.A069083
Numbers n such that sigma(n)/tau(n) has denominator 4.
- Numbers n such that sigma(n)/tau(n) has denominator 5.A069084
Numbers n such that sigma(n)/tau(n) has denominator 5.
- Abundant numbers n such that n = sigma(k) - 2k, where k = sigma(n) - 2n.A069085
Abundant numbers n such that n = sigma(k) - 2k, where k = sigma(n) - 2n.
- Treated as strings, n begins with Floor(sqrt(n)).A069086
Treated as strings, n begins with Floor(sqrt(n)).
- Numbers m such that (1/m)*Sum_{k=1..m} core(k) > phi(m) where core(n) = A007913(n) is the squarefree part of n: the smallest number such that n*a(n) is a square and phi(n) = A000010(n) is the Euler totient function.A069087
Numbers m such that (1/m)*Sum_{k=1..m} core(k) > phi(m) where core(n) = A007913(n) is the squarefree part of n: the smallest number such that n*a(n) is a square and phi(n) = A000010(n) is the Euler totient function.
- a(n) = Sum_{d|n} core(d) where d are the divisors of n and where core(d) is the squarefree part of d: the smallest number such that d*core(d) is a square.A069088
a(n) = Sum_{d|n} core(d) where d are the divisors of n and where core(d) is the squarefree part of d: the smallest number such that d*core(d) is a square.
- a(n) is the number of 0's in a p X p square of a particular function mod p (see Formula) where p is the n-th prime.A069089
a(n) is the number of 0's in a p X p square of a particular function mod p (see Formula) where p is the n-th prime.
- Primes none of whose proper initial segments are primes.A069090
Primes none of whose proper initial segments are primes.
- Jordan function J_6(n).A069091
Jordan function J_6(n).
- Jordan function J_7(n).A069092
Jordan function J_7(n).
- Jordan function J_8(n).A069093
Jordan function J_8(n).
- Jordan function J_9(n).A069094
Jordan function J_9(n).
- Jordan function J_10(n).A069095
Jordan function J_10(n).
- Numbers k such that the numerator of Sum_{d|k} 1/d > 3*k.A069096
Numbers k such that the numerator of Sum_{d|k} 1/d > 3*k.
- Moebius transform of A064987, n*sigma(n).A069097
Moebius transform of A064987, n*sigma(n).
- Number of minimal monic annihilator polynomials over the ring of integers modulo n.A069098
Number of minimal monic annihilator polynomials over the ring of integers modulo n.
- Centered heptagonal numbers.A069099
Centered heptagonal numbers.
- n-th n-digit prime number.A069100
n-th n-digit prime number.
- a(1) = 2; a(2) = 2; a(n) = Prime[a(n-1) + a(n-2)] if n > 2.A069101
a(1) = 2; a(2) = 2; a(n) = Prime[a(n-1) + a(n-2)] if n > 2.
- a(1) = 1; a(2) = 1; a(n) = Prime[n-1] + Prime[n-2] if n > 2.A069102
a(1) = 1; a(2) = 1; a(n) = Prime[n-1] + Prime[n-2] if n > 2.
- a(1) = 1; a(2) = 1; a(n) = prime(a(n-1)) + prime(a(n-2)) if n > 2.A069103
a(1) = 1; a(2) = 1; a(n) = prime(a(n-1)) + prime(a(n-2)) if n > 2.
- Numbers m such that m divides Fibonacci(m+1).A069104
Numbers m such that m divides Fibonacci(m+1).
- 1/n has period 3 in base 10.A069105
1/n has period 3 in base 10.
- Composite numbers k such that k divides F(k-1) where F(j) are the Fibonacci numbers.A069106
Composite numbers k such that k divides F(k-1) where F(j) are the Fibonacci numbers.
- Composite numbers k that divide Fibonacci(k+1).A069107
Composite numbers k that divide Fibonacci(k+1).
- Primes of the form F(k)+k where F(k) is the k-th Fibonacci number.A069108
Primes of the form F(k)+k where F(k) is the k-th Fibonacci number.
- Primes of the form F(k)-k where F(k) is the k-th Fibonacci number.A069109
Primes of the form F(k)-k where F(k) is the k-th Fibonacci number.
- Squarefree part of F(n) (the Fibonacci numbers): the smallest number such that a(n)*F(n) is a square.A069110
Squarefree part of F(n) (the Fibonacci numbers): the smallest number such that a(n)*F(n) is a square.