Sequences
392,541 sequences
- a(n) = number of the column of (R(i,j)) that contains prime(n), where R(i,j) is the rectangle with antidiagonals 1; 2,3; 4,5,6; ...A057061
a(n) = number of the column of (R(i,j)) that contains prime(n), where R(i,j) is the rectangle with antidiagonals 1; 2,3; 4,5,6; ...
- Let R(i,j) be the infinite square array with antidiagonals 1; 2,3; 4,5,6; ...; the n-th prime is in antidiagonal a(n).A057062
Let R(i,j) be the infinite square array with antidiagonals 1; 2,3; 4,5,6; ...; the n-th prime is in antidiagonal a(n).
- Let P(n) of a sequence s(1),s(2),s(3),... be obtained by leaving s(1),...,s(n) fixed and reverse-cyclically permuting every n consecutive terms thereafter; apply P(2) to 1,2,3,... to get PS(2), then apply P(3) to PS(2) to get PS(3), then apply P(4) to PS(3), etc. The limit of PS(n) is A057063.A057063
Let P(n) of a sequence s(1),s(2),s(3),... be obtained by leaving s(1),...,s(n) fixed and reverse-cyclically permuting every n consecutive terms thereafter; apply P(2) to 1,2,3,... to get PS(2), then apply P(3) to PS(2) to get PS(3), then apply P(4) to PS(3), etc. The limit of PS(n) is A057063.
- Let P(n) of a sequence s(1),s(2),s(3),... be obtained by leaving s(1),...,s(n) fixed and forward-cyclically permuting every n consecutive terms thereafter; apply P(2) to 1,2,3,... to get PS(2), then apply P(3) to PS(2) to get PS(3), then apply P(4) to PS(3), etc. The limit of PS(n) is A057064.A057064
Let P(n) of a sequence s(1),s(2),s(3),... be obtained by leaving s(1),...,s(n) fixed and forward-cyclically permuting every n consecutive terms thereafter; apply P(2) to 1,2,3,... to get PS(2), then apply P(3) to PS(2) to get PS(3), then apply P(4) to PS(3), etc. The limit of PS(n) is A057064.
- a(n) = floor(n^n/2).A057065
a(n) = floor(n^n/2).
- a(n) = floor(4^4/n).A057066
a(n) = floor(4^4/n).
- a(n) = floor(5^5/n).A057067
a(n) = floor(5^5/n).
- a(n) = floor(6^6/n).A057068
a(n) = floor(6^6/n).
- a(n) = floor(7^7/n).A057069
a(n) = floor(7^7/n).
- a(n) = floor(8^8/n).A057070
a(n) = floor(8^8/n).
- a(n) = floor(9^9/n).A057071
a(n) = floor(9^9/n).
- a(n) = floor(10^10/n).A057072
a(n) = floor(10^10/n).
- a(n) = floor(11^11/n).A057073
a(n) = floor(11^11/n).
- a(n) = floor(12^12/n).A057074
a(n) = floor(12^12/n).
- Table read by antidiagonals of T(n,k)=floor(n^n/k) with n,k >= 1.A057075
Table read by antidiagonals of T(n,k)=floor(n^n/k) with n,k >= 1.
- A Chebyshev or generalized Fibonacci sequence.A057076
A Chebyshev or generalized Fibonacci sequence.
- Periodic sequence 1,1,-1,-1; expansion of (1+x)/(1+x^2).A057077
Periodic sequence 1,1,-1,-1; expansion of (1+x)/(1+x^2).
- Periodic sequence 1,0,-1,...; expansion of (1+x)/(1+x+x^2).A057078
Periodic sequence 1,0,-1,...; expansion of (1+x)/(1+x+x^2).
- Periodic sequence: repeat [1,2,1,-1,-2,-1]; expansion of (1+x)/(1-x+x^2).A057079
Periodic sequence: repeat [1,2,1,-1,-2,-1]; expansion of (1+x)/(1-x+x^2).
- Even-indexed Chebyshev U-polynomials evaluated at sqrt(10)/2.A057080
Even-indexed Chebyshev U-polynomials evaluated at sqrt(10)/2.
- Even-indexed Chebyshev U-polynomials evaluated at sqrt(11)/2.A057081
Even-indexed Chebyshev U-polynomials evaluated at sqrt(11)/2.
- The next smallest pair of numbers is taken so that a(2n-1)/a(2n) converges to Pi.A057082
The next smallest pair of numbers is taken so that a(2n-1)/a(2n) converges to Pi.
- Scaled Chebyshev U-polynomials evaluated at sqrt(3)/2; expansion of 1/(1 - 3*x + 3*x^2).A057083
Scaled Chebyshev U-polynomials evaluated at sqrt(3)/2; expansion of 1/(1 - 3*x + 3*x^2).
- Scaled Chebyshev U-polynomials evaluated at sqrt(2).A057084
Scaled Chebyshev U-polynomials evaluated at sqrt(2).
- a(n) = 9*a(n-1) - 9*a(n-2) for n>1, with a(0)=0, a(1)=1.A057085
a(n) = 9*a(n-1) - 9*a(n-2) for n>1, with a(0)=0, a(1)=1.
- Scaled Chebyshev U-polynomials evaluated at sqrt(10)/2.A057086
Scaled Chebyshev U-polynomials evaluated at sqrt(10)/2.
- Scaled Chebyshev U-polynomials evaluated at i. Generalized Fibonacci sequence.A057087
Scaled Chebyshev U-polynomials evaluated at i. Generalized Fibonacci sequence.
- Scaled Chebyshev U-polynomials evaluated at i*sqrt(5)/2. Generalized Fibonacci sequence.A057088
Scaled Chebyshev U-polynomials evaluated at i*sqrt(5)/2. Generalized Fibonacci sequence.
- Scaled Chebyshev U-polynomials evaluated at i*sqrt(6)/2. Generalized Fibonacci sequence.A057089
Scaled Chebyshev U-polynomials evaluated at i*sqrt(6)/2. Generalized Fibonacci sequence.
- Scaled Chebyshev U-polynomials evaluated at i*sqrt(7)/2. Generalized Fibonacci sequence.A057090
Scaled Chebyshev U-polynomials evaluated at i*sqrt(7)/2. Generalized Fibonacci sequence.
- Scaled Chebyshev U-polynomials evaluated at i*sqrt(2). Generalized Fibonacci sequence.A057091
Scaled Chebyshev U-polynomials evaluated at i*sqrt(2). Generalized Fibonacci sequence.
- Scaled Chebyshev U-polynomials evaluated at i*3/2. Generalized Fibonacci sequence.A057092
Scaled Chebyshev U-polynomials evaluated at i*3/2. Generalized Fibonacci sequence.
- Scaled Chebyshev U-polynomials evaluated at i*sqrt(10)/2. Generalized Fibonacci sequence.A057093
Scaled Chebyshev U-polynomials evaluated at i*sqrt(10)/2. Generalized Fibonacci sequence.
- Coefficient triangle for certain polynomials (rising powers).A057094
Coefficient triangle for certain polynomials (rising powers).
- Numbers n such that n^2 +1, n^2 +3, n^2 +7, n^2 +9 and n^2 +13 are simultaneously prime.A057095
Numbers n such that n^2 +1, n^2 +3, n^2 +7, n^2 +9 and n^2 +13 are simultaneously prime.
- Saint-Exupéry numbers: ordered products of the three sides of Pythagorean triangles.A057096
Saint-Exupéry numbers: ordered products of the three sides of Pythagorean triangles.
- Products of the three sides of Pythagorean triangles divided by 60.A057097
Products of the three sides of Pythagorean triangles divided by 60.
- Shortest side of a Pythagorean triangle (ordered by the product of the sides).A057098
Shortest side of a Pythagorean triangle (ordered by the product of the sides).
- Middle side of a Pythagorean triangle (ordered by the product of the sides).A057099
Middle side of a Pythagorean triangle (ordered by the product of the sides).
- Hypotenuses of Pythagorean triangles (ordered by the product of the sides).A057100
Hypotenuses of Pythagorean triangles (ordered by the product of the sides).
- Area of a Pythagorean triangle (ordered by the product of the sides).A057101
Area of a Pythagorean triangle (ordered by the product of the sides).
- a(n) = 4 * A073120(n).A057102
a(n) = 4 * A073120(n).
- Triangle of congrua: T(n,k) = 4*n*k(n^2-k^2) with n>k>0 and starting at T(2,1) = 24. A055096(n)^2 + a(n) is a square, as is A055096(n)^2 - a(n).A057103
Triangle of congrua: T(n,k) = 4*n*k(n^2-k^2) with n>k>0 and starting at T(2,1) = 24. A055096(n)^2 + a(n) is a square, as is A055096(n)^2 - a(n).
- The non-octal numbers: numbers containing an 8 or 9 (they cannot be mistaken for octal numbers).A057104
The non-octal numbers: numbers containing an 8 or 9 (they cannot be mistaken for octal numbers).
- Triangle of numbers (when unsigned) related to congruum problem: T(n,k)=k^2+2nk-n^2 with n>k>0 and starting at T(2,1)=1.A057105
Triangle of numbers (when unsigned) related to congruum problem: T(n,k)=k^2+2nk-n^2 with n>k>0 and starting at T(2,1)=1.
- Numbers k such that k(3k-2) is an octagonal palindrome.A057106
Numbers k such that k(3k-2) is an octagonal palindrome.
- Octagonal palindromes.A057107
Octagonal palindromes.
- Difference between the smallest number S(n) with S(n)! a multiple of n and the largest prime factor of n [taking a(1)=0].A057108
Difference between the smallest number S(n) with S(n)! a multiple of n and the largest prime factor of n [taking a(1)=0].
- Numbers n that are not factors of P(n)!, where P(n) is the largest prime factor of n.A057109
Numbers n that are not factors of P(n)!, where P(n) is the largest prime factor of n.
- Difference between largest prime power factor of n and the smallest number S(n) with S(n)! a multiple of n [taking a(1)=0].A057110
Difference between largest prime power factor of n and the smallest number S(n) with S(n)! a multiple of n [taking a(1)=0].