Sequences
392,541 sequences
- a(0) = 5, a(1) = 7; for n>1, a(n) = a(n-1)+a(n-2)-(2n-2).A089061
a(0) = 5, a(1) = 7; for n>1, a(n) = a(n-1)+a(n-2)-(2n-2).
- A nonsense sequence.A089062
A nonsense sequence.
- Numbers k such that 840*k + 175177943 is a prime.A089063
Numbers k such that 840*k + 175177943 is a prime.
- Expansion of e.g.f. log(1-log(1-x)).A089064
Expansion of e.g.f. log(1-log(1-x)).
- Decimal expansion of 2^13466917 - 1, the 39th Mersenne prime A000668(39).A089065
Decimal expansion of 2^13466917 - 1, the 39th Mersenne prime A000668(39).
- Number of distinct classes of permutations of length n under reversal, rotation and complement to n+1.A089066
Number of distinct classes of permutations of length n under reversal, rotation and complement to n+1.
- a(n) = 2*a(n-1) + (-1)^n*a(floor(n/2)); a(1)=1.A089067
a(n) = 2*a(n-1) + (-1)^n*a(floor(n/2)); a(1)=1.
- a(n) = a(n-1)+a(n-2)+a(n-3)+2 with a(0)=0, a(1)=0 and a(2)=1.A089068
a(n) = a(n-1)+a(n-2)+a(n-3)+2 with a(0)=0, a(1)=0 and a(2)=1.
- Let m0 be the matrix {{0,1,0},{0,1,1},{1,0,-q}}, m1={{0,1,0},{0,0,1},{1,1,q1}}; if n even a(n) = (3,3)-element of m[n-1]*m0, if n odd a(n) = (3,3)-element of m[n-1]*m1.A089069
Let m0 be the matrix {{0,1,0},{0,1,1},{1,0,-q}}, m1={{0,1,0},{0,0,1},{1,1,q1}}; if n even a(n) = (3,3)-element of m[n-1]*m0, if n odd a(n) = (3,3)-element of m[n-1]*m1.
- A semi-empirical prime like function with primes isolated.A089070
A semi-empirical prime like function with primes isolated.
- Number of liberties a big eye of size n gives in the game of Go.A089071
Number of liberties a big eye of size n gives in the game of Go.
- Triangle read by rows: T(n,k) = k^n, n >= 1, 1 <= k <= n.A089072
Triangle read by rows: T(n,k) = k^n, n >= 1, 1 <= k <= n.
- Number of symmetric non-crossing connected graphs on n equidistant nodes on a circle.A089073
Number of symmetric non-crossing connected graphs on n equidistant nodes on a circle.
- Expansion of x*(1 + x + x^2)/(1 - 2*x + x^5).A089074
Expansion of x*(1 + x + x^2)/(1 - 2*x + x^5).
- A nonsense sequence.A089075
A nonsense sequence.
- Expansion of -x - x^3*(2 -2*x^4 +x^5)/((1-x^2)*(1+x+x^4)).A089076
Expansion of -x - x^3*(2 -2*x^4 +x^5)/((1-x^2)*(1+x+x^4)).
- A nonsense sequence.A089077
A nonsense sequence.
- Continued fraction for sqrt(2) + sqrt(3).A089078
Continued fraction for sqrt(2) + sqrt(3).
- Numbers n such that 7*n - 23 is prime.A089079
Numbers n such that 7*n - 23 is prime.
- Sequence is S(infinity) where S(1)={1,2} and S(n)=S(n-1)S'(n-1), where S'(k) is obtained from S(k) by replacing the single 1 with the least integer not occurring in S(k).A089080
Sequence is S(infinity) where S(1)={1,2} and S(n)=S(n-1)S'(n-1), where S'(k) is obtained from S(k) by replacing the single 1 with the least integer not occurring in S(k).
- 26th powers: a(n) = n^26.A089081
26th powers: a(n) = n^26.
- Smallest prime factor of 3^n - 2^n.A089082
Smallest prime factor of 3^n - 2^n.
- T(n,k) = (floor(k*n/2) * ceiling(k*n/2))^2, triangular array read by rows, 1 <= k <= n.A089083
T(n,k) = (floor(k*n/2) * ceiling(k*n/2))^2, triangular array read by rows, 1 <= k <= n.
- Numbers n such that abs ( (sum_m (m=1..n) d(m)) / n - log(n) - 2*gamma + 1) is a decreasing sequence, where d(m) is the number of divisors A000005(m) and gamma is Euler's constant A001620.A089084
Numbers n such that abs ( (sum_m (m=1..n) d(m)) / n - log(n) - 2*gamma + 1) is a decreasing sequence, where d(m) is the number of divisors A000005(m) and gamma is Euler's constant A001620.
- Numbers k such that (k! + 3)/3 is prime.A089085
Numbers k such that (k! + 3)/3 is prime.
- Greatest common divisor of n^2-5 and n^2+5.A089086
Greatest common divisor of n^2-5 and n^2+5.
- Triangular array of coefficients multiplied by n! of polynomials in e. These give the expected number of trials needed for the sum of uniform random variables from the interval [0,1] to exceed n+1.A089087
Triangular array of coefficients multiplied by n! of polynomials in e. These give the expected number of trials needed for the sum of uniform random variables from the interval [0,1] to exceed n+1.
- a(0) = 1, a(1) = 2; for n > 1, a(n) = smallest positive number not already in sequence which has GCD > 1 with some earlier term.A089088
a(0) = 1, a(1) = 2; for n > 1, a(n) = smallest positive number not already in sequence which has GCD > 1 with some earlier term.
- Convoluted convolved Fibonacci numbers G_j^(2).A089089
Convoluted convolved Fibonacci numbers G_j^(2).
- a(n) is the smallest composite number coprime to n.A089090
a(n) is the smallest composite number coprime to n.
- a(n) is the smallest composite number coprime to n and n+1.A089091
a(n) is the smallest composite number coprime to n and n+1.
- Convoluted convolved Fibonacci numbers G_j^(5).A089092
Convoluted convolved Fibonacci numbers G_j^(5).
- Convoluted convolved Fibonacci numbers G_j^(6).A089093
Convoluted convolved Fibonacci numbers G_j^(6).
- Convoluted convolved Fibonacci numbers G_j^(7).A089094
Convoluted convolved Fibonacci numbers G_j^(7).
- Convoluted convolved Fibonacci numbers G_j^(8).A089095
Convoluted convolved Fibonacci numbers G_j^(8).
- Convoluted convolved Fibonacci numbers G_j^(9).A089096
Convoluted convolved Fibonacci numbers G_j^(9).
- Convoluted convolved Fibonacci numbers G_j^(10).A089097
Convoluted convolved Fibonacci numbers G_j^(10).
- Sign twisted convoluted convolved Fibonacci numbers H_j^(2).A089098
Sign twisted convoluted convolved Fibonacci numbers H_j^(2).
- Duplicate of A089116.A089099
Duplicate of A089116.
- Duplicate of A089117.A089100
Duplicate of A089117.
- a(n) = (n - 4 + prime(n) mod 9) mod 10.A089101
a(n) = (n - 4 + prime(n) mod 9) mod 10.
- Sign twisted convoluted convolved Fibonacci numbers H_j^(6).A089102
Sign twisted convoluted convolved Fibonacci numbers H_j^(6).
- a(n) = Mod[n+Prime[n],10].A089103
a(n) = Mod[n+Prime[n],10].
- Duplicate of A007334.A089104
Duplicate of A007334.
- Values taken by least witness function W(n).A089105
Values taken by least witness function W(n).
- Sign twisted convoluted convolved Fibonacci numbers H_j^(10).A089106
Sign twisted convoluted convolved Fibonacci numbers H_j^(10).
- Square array T(r,j) (r>=1, j>=1) read by antidiagonals, where T(r,j) is the convoluted convolved Fibonacci number G_j^(r) (see the Moree paper).A089107
Square array T(r,j) (r>=1, j>=1) read by antidiagonals, where T(r,j) is the convoluted convolved Fibonacci number G_j^(r) (see the Moree paper).
- Convoluted convolved Fibonacci numbers G_4^(r).A089108
Convoluted convolved Fibonacci numbers G_4^(r).
- Convoluted convolved Fibonacci numbers G_5^(r).A089109
Convoluted convolved Fibonacci numbers G_5^(r).
- Sign twisted convoluted convolved Fibonacci numbers H_5^(r).A089110
Sign twisted convoluted convolved Fibonacci numbers H_5^(r).