Sequences
392,541 sequences
- Numbers k such that 30*k + 17 and 30*k + 19 are twin primes.A089161
Numbers k such that 30*k + 17 and 30*k + 19 are twin primes.
- Triangle read by rows formed by the prime factors of Mersenne number 2^prime(n) - 1, n >= 1.A089162
Triangle read by rows formed by the prime factors of Mersenne number 2^prime(n) - 1, n >= 1.
- Second prime factor of x = 3^p - 2^p when p is prime and omega(x) >= 2.A089163
Second prime factor of x = 3^p - 2^p when p is prime and omega(x) >= 2.
- Number of steps in all Schroeder paths (i.e., consisting of steps U=(1,1), D=(1,-1),H=(2,0) and never going below the x-axis) from (0,0) to (2n,0).A089164
Number of steps in all Schroeder paths (i.e., consisting of steps U=(1,1), D=(1,-1),H=(2,0) and never going below the x-axis) from (0,0) to (2n,0).
- Partial sums of the central Delannoy numbers (A001850).A089165
Partial sums of the central Delannoy numbers (A001850).
- Number of primes between squares of successive odd numbers.A089166
Number of primes between squares of successive odd numbers.
- Smallest number m that is coprime to n and such that the arithmetic progression (n+k*m:k>0) contains no primes for values not greater than n^2; a(1)=1.A089167
Smallest number m that is coprime to n and such that the arithmetic progression (n+k*m:k>0) contains no primes for values not greater than n^2; a(1)=1.
- Solutions x for x^3-1 = kp where p is prime and k=1,2...A089168
Solutions x for x^3-1 = kp where p is prime and k=1,2...
- Solutions x for x^2-1 = kp where p is prime and k=1,2...A089169
Solutions x for x^2-1 = kp where p is prime and k=1,2...
- Numerator of 2*BernoulliB[2*(n+1)]*(4^(n+1)-1)/(2*(n+1))] divided by numerator of the series coefficients of 1/(1 + Cosh[x]).A089170
Numerator of 2*BernoulliB[2*(n+1)]*(4^(n+1)-1)/(2*(n+1))] divided by numerator of the series coefficients of 1/(1 + Cosh[x]).
- Numerators of series coefficients of 1/(1 + cosh(sqrt(x))).A089171
Numerators of series coefficients of 1/(1 + cosh(sqrt(x))).
- Values of n where numerators of series coefficients of 1/(1 + Cosh[Sqrt[x]]) differ from A002425.A089172
Values of n where numerators of series coefficients of 1/(1 + Cosh[Sqrt[x]]) differ from A002425.
- Solutions x for x^4-1 = kp where p is prime and k=1,2...A089173
Solutions x for x^4-1 = kp where p is prime and k=1,2...
- A nonsense sequence (not well-defined).A089174
A nonsense sequence (not well-defined).
- a(n) = Floor[Sqrt[Prime[n]*PrimePi[n]]].A089175
a(n) = Floor[Sqrt[Prime[n]*PrimePi[n]]].
- Duplicate of A049232.A089176
Duplicate of A049232.
- Triangle read by rows: T(n,k) (n >= 0, 0 <= k <= 1+log_2(floor(n))) giving number of non-squashing partitions of n into k parts.A089177
Triangle read by rows: T(n,k) (n >= 0, 0 <= k <= 1+log_2(floor(n))) giving number of non-squashing partitions of n into k parts.
- Triangle T(n,k) (n >= 0, 0 <= k <= 1+log_2(floor(n+1))) read by rows: row 0 = {1}, row 1 = {1 1}; for n >=2, row n = row n-1 + (row floor((n-1)/2) shifted one place right).A089178
Triangle T(n,k) (n >= 0, 0 <= k <= 1+log_2(floor(n+1))) read by rows: row 0 = {1}, row 1 = {1 1}; for n >=2, row n = row n-1 + (row floor((n-1)/2) shifted one place right).
- Number of equivalence classes of permutations of n letters, where the relation is that f and g are equivalent if every cycle of f is a power of some cycle of g.A089179
Number of equivalence classes of permutations of n letters, where the relation is that f and g are equivalent if every cycle of f is a power of some cycle of g.
- a(n) is the smallest number m such that d(m) = d(m+1) = ... = d(m+n), where d(k) = prime(k+1) - prime(k) (A001223).A089180
a(n) is the smallest number m such that d(m) = d(m+1) = ... = d(m+n), where d(k) = prime(k+1) - prime(k) (A001223).
- (1,3) entry of powers of the orthogonal design shown in A090592.A089181
(1,3) entry of powers of the orthogonal design shown in A090592.
- Prime digit palindromes 2,...,23577532 continued by adding 10^(n-k) and 10^(k-1) times prime(k).A089182
Prime digit palindromes 2,...,23577532 continued by adding 10^(n-k) and 10^(k-1) times prime(k).
- Palindromes in which, in the first half of the number, digits appear in the order 1, 0, 2, 3, 1, 0, 2, 3, 1, ...A089183
Palindromes in which, in the first half of the number, digits appear in the order 1, 0, 2, 3, 1, 0, 2, 3, 1, ...
- A coding semi-palindromic sequence made by converting a zero containing limited digit set palindromic sequence to a fraction and then converting back to an continued fraction array and making the sequence up from the result.A089184
A coding semi-palindromic sequence made by converting a zero containing limited digit set palindromic sequence to a fraction and then converting back to an continued fraction array and making the sequence up from the result.
- Numbers n with following property: suppose n^2 = d1 d2 d3 ...dk in decimal; then d1! + d2! + ... + dk! is a square.A089185
Numbers n with following property: suppose n^2 = d1 d2 d3 ...dk in decimal; then d1! + d2! + ... + dk! is a square.
- Decreases from 9 * 10^k down to 1, restarting at 9 * 10^(k+1).A089186
Decreases from 9 * 10^k down to 1, restarting at 9 * 10^(k+1).
- a(n) is the minimal area of a convex lattice polygon with 2n sides.A089187
a(n) is the minimal area of a convex lattice polygon with 2n sides.
- Lesser member p of a pair of twin primes such that p-1 is squarefree.A089188
Lesser member p of a pair of twin primes such that p-1 is squarefree.
- Primes p such that p-1 is cubefree.A089189
Primes p such that p-1 is cubefree.
- a(n) = Floor[(Prime[n]+PrimePi[n])/2].A089190
a(n) = Floor[(Prime[n]+PrimePi[n])/2].
- Primes p such that p+1 is cubefree.A089191
Primes p such that p+1 is cubefree.
- Numbers n such that 2n - 7 is a prime.A089192
Numbers n such that 2n - 7 is a prime.
- Odd numbers n such that 2*n-7 is a prime of the form 4*k+3.A089193
Odd numbers n such that 2*n-7 is a prime of the form 4*k+3.
- Primes p such that p-1 and p+1 are cube- or higher power-free.A089194
Primes p such that p-1 and p+1 are cube- or higher power-free.
- Primes p such that all prime factors of p-1 have exponent 2.A089195
Primes p such that all prime factors of p-1 have exponent 2.
- Floor(n / (smallest prime factor of n+1)).A089196
Floor(n / (smallest prime factor of n+1)).
- Nonadjacent Fibonacci currency: number of ways to make change for n units in a currency system with coins of value 1, 2, 5, 13, 34, 89, ..., Fibonacci(2k-1).A089197
Nonadjacent Fibonacci currency: number of ways to make change for n units in a currency system with coins of value 1, 2, 5, 13, 34, 89, ..., Fibonacci(2k-1).
- Triangle read by rows: T(n,k) (n>=0, 0<=k<=n) = number of non-squashing partitions of n into distinct parts of which the greatest is k.A089198
Triangle read by rows: T(n,k) (n>=0, 0<=k<=n) = number of non-squashing partitions of n into distinct parts of which the greatest is k.
- Primes p such that p+1 is divisible by a cube.A089199
Primes p such that p+1 is divisible by a cube.
- Primes p such that p-1 is divisible by a cube.A089200
Primes p such that p-1 is divisible by a cube.
- Primes p such that p-3 and p+3 are divisible by a cube.A089201
Primes p such that p-3 and p+3 are divisible by a cube.
- Primes p such that p-2 and p+2 are divisible by a cube.A089202
Primes p such that p-2 and p+2 are divisible by a cube.
- Primes p such that p-2 and p+2 are divisible by a fourth power.A089203
Primes p such that p-2 and p+2 are divisible by a fourth power.
- Triangle read by rows: T(n,k) = numerator of P(n, k) = 1 - n!/(n^k*(n-k)!).A089204
Triangle read by rows: T(n,k) = numerator of P(n, k) = 1 - n!/(n^k*(n-k)!).
- a(n) = n^n * (n-1).A089205
a(n) = n^n * (n-1).
- Denominators of array in A089204.A089206
Denominators of array in A089204.
- a(n) = 4n^3 + 2n^2.A089207
a(n) = 4n^3 + 2n^2.
- Duplicate of A083282.A089208
Duplicate of A083282.
- Table, read by rows, related to Catalan triangle A033184.A089209
Table, read by rows, related to Catalan triangle A033184.
- a(n) = n^(n^(n-1)).A089210
a(n) = n^(n^(n-1)).