Sequences
392,541 sequences
- Number of positive integers of the form (n^2+k^2)/(n-k) for k=1,2,3,4,....,n-1.A066761
Number of positive integers of the form (n^2+k^2)/(n-k) for k=1,2,3,4,....,n-1.
- Duplicate of A066198.A066762
Duplicate of A066198.
- Numbers k such that (k, phi(k)) lies on a circle with integral radius centered at the origin, i.e., k^2 + phi(k)^2 is a square.A066763
Numbers k such that (k, phi(k)) lies on a circle with integral radius centered at the origin, i.e., k^2 + phi(k)^2 is a square.
- Numbers k such that (k, sigma(k)) lies on a circle with integral radius centered at the origin, i.e., k^2 + sigma(k)^2 is a square.A066764
Numbers k such that (k, sigma(k)) lies on a circle with integral radius centered at the origin, i.e., k^2 + sigma(k)^2 is a square.
- Numbers k such that phi(k) < k/5.A066765
Numbers k such that phi(k) < k/5.
- Decimal expansion of Sum_{k>=1} sigma(k)/2^k where sigma(k) is the sum of divisors of k, 1 <= d <= k.A066766
Decimal expansion of Sum_{k>=1} sigma(k)/2^k where sigma(k) is the sum of divisors of k, 1 <= d <= k.
- a(n) = Sum_{k=1..n} sigma(k)*2^(n-k) where sigma(k) = A000203(k) is the sum of divisors of k.A066767
a(n) = Sum_{k=1..n} sigma(k)*2^(n-k) where sigma(k) = A000203(k) is the sum of divisors of k.
- a(n) = Sum_{d|n} binomial(2*d-2,d-1).A066768
a(n) = Sum_{d|n} binomial(2*d-2,d-1).
- a(n) = Sum_{d|n} d*Fibonacci(n/d).A066769
a(n) = Sum_{d|n} d*Fibonacci(n/d).
- a(n) = 5^n*sin(2n*arctan(1/2)) or numerator of tan(2n*arctan(1/2)).A066770
a(n) = 5^n*sin(2n*arctan(1/2)) or numerator of tan(2n*arctan(1/2)).
- a(n) = 5^n*cos(2*n*arctan(1/2)) or denominator of tan(2*n*arctan(1/2)).A066771
a(n) = 5^n*cos(2*n*arctan(1/2)) or denominator of tan(2*n*arctan(1/2)).
- Continued fraction expansion for Sum_{k>=1} d(k)/2^k where d(k) are divisors of k, 1 <= d <= k.A066772
Continued fraction expansion for Sum_{k>=1} d(k)/2^k where d(k) are divisors of k, 1 <= d <= k.
- Smallest number which requires n^2 steps in the 3x+1 problem.A066773
Smallest number which requires n^2 steps in the 3x+1 problem.
- A066728(a(n))=3.A066774
A066728(a(n))=3.
- Primes p such that 2*p^2 is not in A066721.A066775
Primes p such that 2*p^2 is not in A066721.
- Numbers k such that A043347(k) is a prime.A066776
Numbers k such that A043347(k) is a prime.
- First differences of Stern's sequence A005230.A066777
First differences of Stern's sequence A005230.
- a(n) = Sum_{i=1..n} floor((3/2)^i).A066778
a(n) = Sum_{i=1..n} floor((3/2)^i).
- Sum of squarefree numbers <= n.A066779
Sum of squarefree numbers <= n.
- a(n) = Product_{k=1..n} sigma(k); sigma(k) is the sum of the positive divisors of n.A066780
a(n) = Product_{k=1..n} sigma(k); sigma(k) is the sum of the positive divisors of n.
- a(n) = 2^phi(n).A066781
a(n) = 2^phi(n).
- Numbers k such that (k, phi(k)) lies on the hyperbola x^2 - y^2 = m^2, for some natural number m, i.e., k^2 - phi(k)^2 is a square.A066782
Numbers k such that (k, phi(k)) lies on the hyperbola x^2 - y^2 = m^2, for some natural number m, i.e., k^2 - phi(k)^2 is a square.
- Integers of the form (prime(k)+1)/phi(k), by order of appearance.A066783
Integers of the form (prime(k)+1)/phi(k), by order of appearance.
- Numbers n such that (n, sigma(n)) lies on the hyperbola y^2 - x^2 = m^2, for some natural number m, i.e., sigma(n)^2 - n^2 = m^2.A066784
Numbers n such that (n, sigma(n)) lies on the hyperbola y^2 - x^2 = m^2, for some natural number m, i.e., sigma(n)^2 - n^2 = m^2.
- Numbers k such that (k, phi(k), sigma(k)) lies on a sphere with integral radius centered at the origin, i.e., k^2 + phi(k)^2 + sigma(k)^2 is a square.A066785
Numbers k such that (k, phi(k), sigma(k)) lies on a sphere with integral radius centered at the origin, i.e., k^2 + phi(k)^2 + sigma(k)^2 is a square.
- a(n) is the least k such that the distance between (n, phi(n)) and (n+k, phi(n+k)) is an integer (i.e., k^2 + (phi(n+k) - phi(n))^2 is a square), or 0 if none exists.A066786
a(n) is the least k such that the distance between (n, phi(n)) and (n+k, phi(n+k)) is an integer (i.e., k^2 + (phi(n+k) - phi(n))^2 is a square), or 0 if none exists.
- a(n) = gcd(2^n + 1, n^2 + 1).A066787
a(n) = gcd(2^n + 1, n^2 + 1).
- a(n) = gcd(phi(n), n^2 + 1).A066788
a(n) = gcd(phi(n), n^2 + 1).
- a(n) = binomial(n^3, n^2).A066789
a(n) = binomial(n^3, n^2).
- a(n) = least natural number k such that the distance between (n, sigma(n)) and (n+k, sigma(n+k)) is an integer (i.e., k^2 + (sigma(n+k) - sigma(n))^2 is a square), if such k exists; 0 otherwise.A066790
a(n) = least natural number k such that the distance between (n, sigma(n)) and (n+k, sigma(n+k)) is an integer (i.e., k^2 + (sigma(n+k) - sigma(n))^2 is a square), if such k exists; 0 otherwise.
- a(n) = phi(n^2 + n + 1).A066791
a(n) = phi(n^2 + n + 1).
- a(n) = phi(n^3 + n^2 + n + 1).A066792
a(n) = phi(n^3 + n^2 + n + 1).
- The start of a record-breaking run of consecutive integers with an even number of prime factors.A066793
The start of a record-breaking run of consecutive integers with an even number of prime factors.
- Start of a record-breaking run of consecutive integers with an odd number of prime factors.A066794
Start of a record-breaking run of consecutive integers with an odd number of prime factors.
- Inverted decimal expansion of Pi.A066795
Inverted decimal expansion of Pi.
- a(n) = Sum_{i=1..n} binomial(2*i,i).A066796
a(n) = Sum_{i=1..n} binomial(2*i,i).
- a(n) = Sum_{i=1..n} binomial(4*i,2*i).A066797
a(n) = Sum_{i=1..n} binomial(4*i,2*i).
- a(n) = Sum_{i=1..n} binomial(6*i,3*i).A066798
a(n) = Sum_{i=1..n} binomial(6*i,3*i).
- Square array read by antidiagonals of eventual period of powers of k mod n; period of repeating digits of 1/n in base k.A066799
Square array read by antidiagonals of eventual period of powers of k mod n; period of repeating digits of 1/n in base k.
- Number of different eventual period lengths for power sequences mod n; i.e., number of different period lengths of repeating digits of 1/n in different bases.A066800
Number of different eventual period lengths for power sequences mod n; i.e., number of different period lengths of repeating digits of 1/n in different bases.
- A self-generating sequence: let S = {}, a(0) = 333; for n >= 1, factorize a(n-1), arrange prime factors in increasing order and append their digits to S; then a(n) is the 3-digit number formed from terms 3n, 3n+1, 3n+2 of S. Leading zeros are omitted from a(n).A066801
A self-generating sequence: let S = {}, a(0) = 333; for n >= 1, factorize a(n-1), arrange prime factors in increasing order and append their digits to S; then a(n) is the 3-digit number formed from terms 3n, 3n+1, 3n+2 of S. Leading zeros are omitted from a(n).
- a(n) = binomial(6*n,3*n).A066802
a(n) = binomial(6*n,3*n).
- a(n) = gcd(2^n + 1, 3^n + 1).A066803
a(n) = gcd(2^n + 1, 3^n + 1).
- Sum of diagonal elements and those below it for a square matrix of integers, starting with 1.A066804
Sum of diagonal elements and those below it for a square matrix of integers, starting with 1.
- a(n) is the least k such that n + Sum_{i=1..k} A018252(i) is prime; or 0 if none exists.A066805
a(n) is the least k such that n + Sum_{i=1..k} A018252(i) is prime; or 0 if none exists.
- Expansion of Product_{k>=1} (1+x^k)^A001055(k).A066806
Expansion of Product_{k>=1} (1+x^k)^A001055(k).
- Integers of the form (2^k+1)/k.A066807
Integers of the form (2^k+1)/k.
- a(n) = F(n)-1 mod 2^n+1 with F(n) = n-th Fermat number = 1+2^2^n.A066808
a(n) = F(n)-1 mod 2^n+1 with F(n) = n-th Fermat number = 1+2^2^n.
- a(n) = sum of modular offsets: mod[n+c,b]-(mod[n,b]+c) for c<=b<=n.A066809
a(n) = sum of modular offsets: mod[n+c,b]-(mod[n,b]+c) for c<=b<=n.
- Expansion of x^2/((1-3*x)*(1-2*x)^2).A066810
Expansion of x^2/((1-3*x)*(1-2*x)^2).