Sequences
392,541 sequences
- Number of ways associated with A088959.A088111
Number of ways associated with A088959.
- Perfect powers whose digit reversal is prime.A088112
Perfect powers whose digit reversal is prime.
- a(n) = digit reversal of (11^n) divided by 11.A088113
a(n) = digit reversal of (11^n) divided by 11.
- Near duplicate of A071277.A088114
Near duplicate of A071277.
- a(n) = largest prime using least number of possible digits with a digit sum n, or 0 if no such number exists. E.g., if n > 9 and there are no two-digit primes with a given digit sum n then three-digit numbers are explored and so on.A088115
a(n) = largest prime using least number of possible digits with a digit sum n, or 0 if no such number exists. E.g., if n > 9 and there are no two-digit primes with a given digit sum n then three-digit numbers are explored and so on.
- Let n = abc..., where a, b, c, are digits of n. a(n) = a*bc...+b*ac...+c*ab...+..., i.e., a(n) = sum, over all the digits, of the product (number obtained by deleting a digit multiplied by the deleted digit).A088116
Let n = abc..., where a, b, c, are digits of n. a(n) = a*bc...+b*ac...+c*ab...+..., i.e., a(n) = sum, over all the digits, of the product (number obtained by deleting a digit multiplied by the deleted digit).
- Let the decimal expansion of n be abcd...; then a(n) = (a*bcd... + b*acd... + c*abd... + d*abc... + ...) + (ab*cd... + bc*ad... + cd*ab... + ...) + ... . That is, a(n) = sum over all the digit strings of the product (number obtained by deleting a digit string) * (deleted digit string).A088117
Let the decimal expansion of n be abcd...; then a(n) = (a*bcd... + b*acd... + c*abd... + d*abc... + ...) + (ab*cd... + bc*ad... + cd*ab... + ...) + ... . That is, a(n) = sum over all the digit strings of the product (number obtained by deleting a digit string) * (deleted digit string).
- Duplicate of A088117.A088118
Duplicate of A088117.
- Sequence of primes p(n) such that 2*p(n)+3, 2*p(n+1)+3, 2*p(n+2)+3 are consecutive primes, where p(i) denotes the i-th prime.A088119
Sequence of primes p(n) such that 2*p(n)+3, 2*p(n+1)+3, 2*p(n+2)+3 are consecutive primes, where p(i) denotes the i-th prime.
- Smallest prime obtained as a product of n terms of an arithmetic progression + the common difference.A088120
Smallest prime obtained as a product of n terms of an arithmetic progression + the common difference.
- Smallest prime obtained as a sum of n terms of a geometric progression + the common ratio, or 0 if no such terms exists. Smallest prime of the form (a +ar +ar^2 + ar^3 +... ) + r.A088121
Smallest prime obtained as a sum of n terms of a geometric progression + the common ratio, or 0 if no such terms exists. Smallest prime of the form (a +ar +ar^2 + ar^3 +... ) + r.
- Let f(n,x) = 1 + 2x + 3x^2 + 5x^3 + 7x^4 + ... + prime(n)*x^n; a(n) = smallest prime f(n,x), or 0 if no such prime exists.A088122
Let f(n,x) = 1 + 2x + 3x^2 + 5x^3 + 7x^4 + ... + prime(n)*x^n; a(n) = smallest prime f(n,x), or 0 if no such prime exists.
- Let f(n,x) = 1 + 2x + 3x^2 + 5x^3 + 7x^4 + ... + prime(n)*x^n; a(n) = smallest value of x such that f(n,x) is a prime, or 0 if no such prime exists.A088123
Let f(n,x) = 1 + 2x + 3x^2 + 5x^3 + 7x^4 + ... + prime(n)*x^n; a(n) = smallest value of x such that f(n,x) is a prime, or 0 if no such prime exists.
- Let f(n,x) = 1 + 4x + 6x^2 + 8x^3 + 9x^4 + ... + composite(n)*x^n; a(n)= smallest prime f(n,x), or 0 if no such prime exists.A088124
Let f(n,x) = 1 + 4x + 6x^2 + 8x^3 + 9x^4 + ... + composite(n)*x^n; a(n)= smallest prime f(n,x), or 0 if no such prime exists.
- Let f(n,x) = 1 + 4*x + 6*x^2 + 8*x^3 + 9*x^4 + ... + composite(n)*x^n; a(n) = smallest x such that f(n,x) is a prime, or 0 if no such prime exists.A088125
Let f(n,x) = 1 + 4*x + 6*x^2 + 8*x^3 + 9*x^4 + ... + composite(n)*x^n; a(n) = smallest x such that f(n,x) is a prime, or 0 if no such prime exists.
- Let f(n, x) = x+3x^2+6x^3+...+(n(n+1)/2)x^n; then a(n) = least x such that f(n, x) is a triangular number, or 0 if no such x exists.A088126
Let f(n, x) = x+3x^2+6x^3+...+(n(n+1)/2)x^n; then a(n) = least x such that f(n, x) is a triangular number, or 0 if no such x exists.
- E.g.f. exp(-x)*cosh(x)/(1-x)^2.A088127
E.g.f. exp(-x)*cosh(x)/(1-x)^2.
- Expansion of e.g.f.: cosh(x)/(1-x)^2.A088128
Expansion of e.g.f.: cosh(x)/(1-x)^2.
- Expansion of e.g.f. sinh(x)/(1-x)^2.A088129
Expansion of e.g.f. sinh(x)/(1-x)^2.
- Erroneous version of A076497.A088130
Erroneous version of A076497.
- a(n) equals the square of the n-th partial sum added to twice the n-th partial sum of the squares, divided by a(n-1), for all n>=1, with a(0)=1, a(1)=1.A088131
a(n) equals the square of the n-th partial sum added to twice the n-th partial sum of the squares, divided by a(n-1), for all n>=1, with a(0)=1, a(1)=1.
- a(n) equals the square of the n-th partial sum added to twice the n-th partial sum of the squares, divided by a(n-1), for all n>1, with a(0)=1, a(1)=3.A088132
a(n) equals the square of the n-th partial sum added to twice the n-th partial sum of the squares, divided by a(n-1), for all n>1, with a(0)=1, a(1)=3.
- Sum of first and last digits of n. Different from A115299.A088133
Sum of first and last digits of n. Different from A115299.
- Numbers n such that sum of first and last digits is prime.A088134
Numbers n such that sum of first and last digits is prime.
- Sum of first and last digits of n-th prime.A088135
Sum of first and last digits of n-th prime.
- Primes such that sum of first and last digits is prime.A088136
Primes such that sum of first and last digits is prime.
- Generalized Gaussian Fibonacci integers.A088137
Generalized Gaussian Fibonacci integers.
- Generalized Gaussian Fibonacci integers.A088138
Generalized Gaussian Fibonacci integers.
- a(n) = 2*a(n-1) - 6*a(n-2), a(0)=0, a(1)=1.A088139
a(n) = 2*a(n-1) - 6*a(n-2), a(0)=0, a(1)=1.
- Duplicate of A005451 (for n >= 3).A088140
Duplicate of A005451 (for n >= 3).
- a(n) = the largest k such that, if k samples are taken from a group of n items, with replacement, a duplication is unlikely (p<1/2).A088141
a(n) = the largest k such that, if k samples are taken from a group of n items, with replacement, a duplication is unlikely (p<1/2).
- Number of partitions of n-set with 2 block sizes.A088142
Number of partitions of n-set with 2 block sizes.
- Find the shortest prefix of Pi-3 = .141592653589793238462643383279502.. which is divisible by n and divide by n.A088143
Find the shortest prefix of Pi-3 = .141592653589793238462643383279502.. which is divisible by n and divide by n.
- Sum of primitive roots of n-th prime.A088144
Sum of primitive roots of n-th prime.
- Let p = prime(n); then a(n) = (Sum(primitive roots of p) - moebius(p-1))/p.A088145
Let p = prime(n); then a(n) = (Sum(primitive roots of p) - moebius(p-1))/p.
- n-th prime rotated one binary place to the right.A088146
n-th prime rotated one binary place to the right.
- n-th prime rotated one binary place to the left.A088147
n-th prime rotated one binary place to the left.
- Least number which when rotated through all its binary places produces n primes, not counting any repeats.A088148
Least number which when rotated through all its binary places produces n primes, not counting any repeats.
- Smallest prime which when rotated through all its binary places produces n primes, not counting any repeats.A088149
Smallest prime which when rotated through all its binary places produces n primes, not counting any repeats.
- Value of n-th digit (counting from the right) in binary representation of n^n.A088150
Value of n-th digit (counting from the right) in binary representation of n^n.
- Value of n-th digit in ternary representation of n^n.A088151
Value of n-th digit in ternary representation of n^n.
- Value of n-th digit in octal representation of n^n.A088152
Value of n-th digit in octal representation of n^n.
- a(n) is the value of the n-th digit in the decimal representation of n^n.A088153
a(n) is the value of the n-th digit in the decimal representation of n^n.
- Value of n-th digit in duodecimal representation of n^n.A088154
Value of n-th digit in duodecimal representation of n^n.
- Value of n-th digit in hexadecimal representation of n^n.A088155
Value of n-th digit in hexadecimal representation of n^n.
- Value of n-th digit in vigesimal representation of n^n.A088156
Value of n-th digit in vigesimal representation of n^n.
- Value of (n+1)-th digit in sexagesimal representation of n^n.A088157
Value of (n+1)-th digit in sexagesimal representation of n^n.
- Square table T(n,k), read by antidiagonals, that satisfies T(n,0)=1, T(n+1,k+1) = sum(i=0,n, sum(j=0,k, T(n-i,k-j)*T(i,j) )), such that the top row and diagonal are equal: T(0,k)=T(k,k)=A088159(k).A088158
Square table T(n,k), read by antidiagonals, that satisfies T(n,0)=1, T(n+1,k+1) = sum(i=0,n, sum(j=0,k, T(n-i,k-j)*T(i,j) )), such that the top row and diagonal are equal: T(0,k)=T(k,k)=A088159(k).
- First row and main diagonal of square table that satisfies T(n+1,k+1) = sum(i=0,n, sum(j=0,k, T(n-i,k-j)*T(i,j) )).A088159
First row and main diagonal of square table that satisfies T(n+1,k+1) = sum(i=0,n, sum(j=0,k, T(n-i,k-j)*T(i,j) )).
- Sum of antidiagonals of square table that satisfies T(n+1,k+1) = sum(i=0,n, sum(j=0,k, T(n-i,k-j)*T(i,j) )) such that the top row and diagonal are equal: T(0,k)=T(k,k)=A088159(k).A088160
Sum of antidiagonals of square table that satisfies T(n+1,k+1) = sum(i=0,n, sum(j=0,k, T(n-i,k-j)*T(i,j) )) such that the top row and diagonal are equal: T(0,k)=T(k,k)=A088159(k).