Sequences
392,541 sequences
- Convoluted convolved Fibonacci numbers G_6^(r).A089111
Convoluted convolved Fibonacci numbers G_6^(r).
- Square array T(r,j) (r >= 1, j >= 1) read by antidiagonals, where T(r,j) is the sign twisted convoluted convolved Fibonacci number H_j^(r) (see the Moree paper).A089112
Square array T(r,j) (r >= 1, j >= 1) read by antidiagonals, where T(r,j) is the sign twisted convoluted convolved Fibonacci number H_j^(r) (see the Moree paper).
- Convoluted convolved Fibonacci numbers G_7^(r).A089113
Convoluted convolved Fibonacci numbers G_7^(r).
- Sign twisted convoluted convolved Fibonacci numbers H_7^(r).A089114
Sign twisted convoluted convolved Fibonacci numbers H_7^(r).
- Convoluted convolved Fibonacci numbers G_8^(r).A089115
Convoluted convolved Fibonacci numbers G_8^(r).
- Convoluted convolved Fibonacci numbers G_j^(3).A089116
Convoluted convolved Fibonacci numbers G_j^(3).
- Convoluted convolved Fibonacci numbers G_j^(4).A089117
Convoluted convolved Fibonacci numbers G_j^(4).
- Nonnegative numbers in (3*A005836 - 1) [A005836 are the numbers with base representation containing no 2].A089118
Nonnegative numbers in (3*A005836 - 1) [A005836 are the numbers with base representation containing no 2].
- Complement of ((3*A005836) union (3*A005836 - 1) union (3*A005836 - 2)).A089119
Complement of ((3*A005836) union (3*A005836 - 1) union (3*A005836 - 2)).
- Smallest prime factor of n^2 + 1.A089120
Smallest prime factor of n^2 + 1.
- Duplicate of A014442.A089121
Duplicate of A014442.
- Triangle read by rows in which row n gives prime factors of n^2 + 1.A089122
Triangle read by rows in which row n gives prime factors of n^2 + 1.
- Smallest prime factor of numbers of the form A^2 + 3.A089123
Smallest prime factor of numbers of the form A^2 + 3.
- Largest prime factor of n^2 + 3.A089124
Largest prime factor of n^2 + 3.
- a(n+2) = a(n+1) + F(n+1)*a(n), where F = Fibonacci number (A000045) and a(0) = a(1) = 1.A089125
a(n+2) = a(n+1) + F(n+1)*a(n), where F = Fibonacci number (A000045) and a(0) = a(1) = 1.
- a(n+2) = F(n+1)*a(n+1) + F(n)*a(n) where F(n) = Fibonacci number (A000045), a(0) = a(1) = 1.A089126
a(n+2) = F(n+1)*a(n+1) + F(n)*a(n) where F(n) = Fibonacci number (A000045), a(0) = a(1) = 1.
- a(n+2) = F(n)*a(n+1) + F(n+1)*a(n) where F(n) = Fibonacci number (A000045) and a(0) = a(1) = 1.A089127
a(n+2) = F(n)*a(n+1) + F(n+1)*a(n) where F(n) = Fibonacci number (A000045) and a(0) = a(1) = 1.
- a(n) = gcd(6,n).A089128
a(n) = gcd(6,n).
- Greatest common divisor of n^2 - 7 and n^2 + 7.A089129
Greatest common divisor of n^2 - 7 and n^2 + 7.
- Primes of the form (k! + 2)/2.A089130
Primes of the form (k! + 2)/2.
- Primes of the form (k! + 3)/3.A089131
Primes of the form (k! + 3)/3.
- First prime in the progression (n!+m)/m.A089132
First prime in the progression (n!+m)/m.
- a(n) = If [ Mod[A001591[n], 1]=1 then A001591[n] else A001591[n]+1 If PrimeQ[a[n]]==True then a[n].A089133
a(n) = If [ Mod[A001591[n], 1]=1 then A001591[n] else A001591[n]+1 If PrimeQ[a[n]]==True then a[n].
- a(n) = -a(n-1) - a(n-2) + a(n-3) - a(n-5).A089134
a(n) = -a(n-1) - a(n-2) + a(n-3) - a(n-5).
- a(n) = -a(n-2) + 2*a(n-4) - a(n-10).A089135
a(n) = -a(n-2) + 2*a(n-4) - a(n-10).
- Primes in the progression (n! + m)/m where n advances by 1 and m resets to 1 upon each prime occurrence.A089136
Primes in the progression (n! + m)/m where n advances by 1 and m resets to 1 upon each prime occurrence.
- Primes in the progression (n!- m)/m where n advances by 1 and m resets to 1 upon each prime occurrence.A089137
Primes in the progression (n!- m)/m where n advances by 1 and m resets to 1 upon each prime occurrence.
- a(n) = (3^(2*n))*(integral_{x=0 to 1} (1+x^3)^n dx)/(integral_{x=0 to 1} (1-x^3)^n dx).A089138
a(n) = (3^(2*n))*(integral_{x=0 to 1} (1+x^3)^n dx)/(integral_{x=0 to 1} (1-x^3)^n dx).
- Decimal expansion of e^4 - 3*e^3 + 2*e^2 - e/6.A089139
Decimal expansion of e^4 - 3*e^3 + 2*e^2 - e/6.
- Number of subsequences of {1,2,3,...,n} which are p_1-sequences.A089140
Number of subsequences of {1,2,3,...,n} which are p_1-sequences.
- Square array, read by antidiagonal: T(n,k) = n*T(n,k-1)+(-1)^k*T(n,floor(k/2)).A089141
Square array, read by antidiagonal: T(n,k) = n*T(n,k-1)+(-1)^k*T(n,floor(k/2)).
- Numbers k such that 5^k + 6 is prime.A089142
Numbers k such that 5^k + 6 is prime.
- a(n) = 9*2^n - 6.A089143
a(n) = 9*2^n - 6.
- Primes p such that 6*p-5 and 6*p-1 are primes.A089144
Primes p such that 6*p-5 and 6*p-1 are primes.
- Greatest common divisor of n^2-3 and n^2+3.A089145
Greatest common divisor of n^2-3 and n^2+3.
- a(n) = gcd(n^2 - 4, n^2 + 4).A089146
a(n) = gcd(n^2 - 4, n^2 + 4).
- Numbers k such that 10^k + 7*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.A089147
Numbers k such that 10^k + 7*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Expansion of e.g.f.: 1/(exp(x) - x).A089148
Expansion of e.g.f.: 1/(exp(x) - x).
- a(1) = 1; for n > 1, a(n) = smallest power of n such that n^m - a(n-1) is a positive prime.A089149
a(1) = 1; for n > 1, a(n) = smallest power of n such that n^m - a(n-1) is a positive prime.
- a(1) = 1; for > 1, a(n) = smallest m such that n^m - {(n-1)^a(n-1)} is a positive prime.A089150
a(1) = 1; for > 1, a(n) = smallest m such that n^m - {(n-1)^a(n-1)} is a positive prime.
- Primes p such that 6*p - 7 and 6*p - 5 are twin primes.A089151
Primes p such that 6*p - 7 and 6*p - 5 are twin primes.
- Primes p such that 6*p-7 and 6*p-5 are twin primes and p is also a twin prime.A089152
Primes p such that 6*p-7 and 6*p-5 are twin primes and p is also a twin prime.
- Duplicate of A075136.A089153
Duplicate of A075136.
- Expansion of 2*x*(x+2) / ((x-1)*(x^2+6*x-1)).A089154
Expansion of 2*x*(x+2) / ((x-1)*(x^2+6*x-1)).
- a(n) = (2*n)!*(Integral_{x=0..sqrt(2/3)} 1/(1-x^2)^(n+1/2) dx)/((n!*2^n)*sqrt(2)).A089155
a(n) = (2*n)!*(Integral_{x=0..sqrt(2/3)} 1/(1-x^2)^(n+1/2) dx)/((n!*2^n)*sqrt(2)).
- a(n) = A069722(n+1)^2.A089156
a(n) = A069722(n+1)^2.
- Numbers n such that 30*n+7, 30*n+11, 30*n+13, 30*n+17, 30*n+19 are consecutive primes.A089157
Numbers n such that 30*n+7, 30*n+11, 30*n+13, 30*n+17, 30*n+19 are consecutive primes.
- Second prime factor, if it exists, of Mersenne numbers.A089158
Second prime factor, if it exists, of Mersenne numbers.
- If Mersenne numbers have 3 or more factors, then list the third factor.A089159
If Mersenne numbers have 3 or more factors, then list the third factor.
- Numbers k such that 30*k + 11 and 30*k + 13 are twin primes.A089160
Numbers k such that 30*k + 11 and 30*k + 13 are twin primes.