Sequences
392,541 sequences
- Numbers n such that n^10 reversed is a prime.A059211
Numbers n such that n^10 reversed is a prime.
- Numbers n such that n^11 reversed is a prime.A059212
Numbers n such that n^11 reversed is a prime.
- Numbers n such that n^12 reversed is a prime.A059213
Numbers n such that n^12 reversed is a prime.
- Square array T(k,n) = C(n-1,k) + Sum_{i=0..k} C(n,i) read by antidiagonals (k >= 1, n >= 1).A059214
Square array T(k,n) = C(n-1,k) + Sum_{i=0..k} C(n,i) read by antidiagonals (k >= 1, n >= 1).
- Least number k such that k^n reversed is a prime.A059215
Least number k such that k^n reversed is a prime.
- Variation of Boustrophedon transform applied to all-1's sequence (see Comments for details).A059216
Variation of Boustrophedon transform applied to all-1's sequence (see Comments for details).
- The array in A059216 read by antidiagonals in 'up' direction.A059217
The array in A059216 read by antidiagonals in 'up' direction.
- Numbers k that divide the sum of the first k partition numbers (A000041) and the sum of the first k unique partition numbers (A000009).A059218
Numbers k that divide the sum of the first k partition numbers (A000041) and the sum of the first k unique partition numbers (A000009).
- Variation of Boustrophedon transform applied to sequence 1,0,0,0,...: fill an array by diagonals in alternating directions - 'up' and 'down'. The first element of each diagonal after the first is 0. When 'going up', add to the previous element the elements of the row the new element is in. When 'going down', add to the previous element the elements of the column the new element is in. The final element of the n-th diagonal is a(n).A059219
Variation of Boustrophedon transform applied to sequence 1,0,0,0,...: fill an array by diagonals in alternating directions - 'up' and 'down'. The first element of each diagonal after the first is 0. When 'going up', add to the previous element the elements of the row the new element is in. When 'going down', add to the previous element the elements of the column the new element is in. The final element of the n-th diagonal is a(n).
- The array in A059219 read by antidiagonals in 'up' direction.A059220
The array in A059219 read by antidiagonals in 'up' direction.
- Number of 3-bead necklaces where each bead is an unlabeled rooted tree, by total number of nodes.A059221
Number of 3-bead necklaces where each bead is an unlabeled rooted tree, by total number of nodes.
- Minimal number of disjoint edge-paths into which the graph of the n-ary cube can be partitioned.A059222
Minimal number of disjoint edge-paths into which the graph of the n-ary cube can be partitioned.
- Primes p such that x^37 = 2 has no solution mod p.A059223
Primes p such that x^37 = 2 has no solution mod p.
- a(n) = 2^(n-3)*(n + 3)*(2*n - 3).A059224
a(n) = 2^(n-3)*(n + 3)*(2*n - 3).
- Primes p such that x^31 = 2 has no solution mod p.A059225
Primes p such that x^31 = 2 has no solution mod p.
- Triangle T(n,k) (0 <= k <= n) read by rows: top entry is 1, all other rows begin with 0; typical entry is sum of entry to left plus sum of all entries above it in the triangle.A059226
Triangle T(n,k) (0 <= k <= n) read by rows: top entry is 1, all other rows begin with 0; typical entry is sum of entry to left plus sum of all entries above it in the triangle.
- Last entry in n-th row of triangle defined in A059226.A059227
Last entry in n-th row of triangle defined in A059226.
- Row sums of triangle defined in A059226.A059228
Row sums of triangle defined in A059226.
- A diagonal of triangle defined in A059226.A059229
A diagonal of triangle defined in A059226.
- Primes p such that x^61 = 2 has no solution mod p.A059230
Primes p such that x^61 = 2 has no solution mod p.
- Number of different lattice paths running from (0,0) to (n,0) using steps from S = {(k,k) or (k,-k): k positive integer} that never go below the x-axis.A059231
Number of different lattice paths running from (0,0) to (n,0) using steps from S = {(k,k) or (k,-k): k positive integer} that never go below the x-axis.
- a(1)= 1, a(n) = (a(n-1)^a(n-1)) + n.A059232
a(1)= 1, a(n) = (a(n-1)^a(n-1)) + n.
- Number of rows in which n appears in Pascal's triangle A007318.A059233
Number of rows in which n appears in Pascal's triangle A007318.
- The array in A059216 read by antidiagonals in the direction in which it was constructed.A059234
The array in A059216 read by antidiagonals in the direction in which it was constructed.
- The array in A059219 read by antidiagonals in the direction in which it was constructed.A059235
The array in A059219 read by antidiagonals in the direction in which it was constructed.
- Primes p such that x^41 = 2 has no solution mod p.A059236
Primes p such that x^41 = 2 has no solution mod p.
- Variation of Boustrophedon transform described in A059219 applied to sequence 0,1,0,0,0,....A059237
Variation of Boustrophedon transform described in A059219 applied to sequence 0,1,0,0,0,....
- Orders of the finite groups GL_2(K) when K is a finite field with q = A246655(n) elements.A059238
Orders of the finite groups GL_2(K) when K is a finite field with q = A246655(n) elements.
- Numerators of coefficients of asymptotic expansion related to iterated sine function.A059239
Numerators of coefficients of asymptotic expansion related to iterated sine function.
- Denominators of coefficients of asymptotic expansion related to iterated sine function.A059240
Denominators of coefficients of asymptotic expansion related to iterated sine function.
- Primes p such that x^11 = 2 has no solution mod p.A059241
Primes p such that x^11 = 2 has no solution mod p.
- Numbers k such that 2^k + 5 is prime.A059242
Numbers k such that 2^k + 5 is prime.
- Primes p such that x^43 = 2 has no solution mod p.A059243
Primes p such that x^43 = 2 has no solution mod p.
- Primes p such that x^19 = 2 has no solution mod p.A059244
Primes p such that x^19 = 2 has no solution mod p.
- Primes p such that x^13 = 2 has no solution mod p.A059245
Primes p such that x^13 = 2 has no solution mod p.
- Numerator of Sum_{j=1..n} d(j)/n, where d = number of divisors function (A000005).A059246
Numerator of Sum_{j=1..n} d(j)/n, where d = number of divisors function (A000005).
- Denominator of Sum_{j=1..n} d(j)/n, where d = number of divisors function (A000005).A059247
Denominator of Sum_{j=1..n} d(j)/n, where d = number of divisors function (A000005).
- Numerator of 1/F(1) + 1/F(2) + 1/F(3) + ... + 1/F(n), where F(n) is the n-th Fibonacci number (A000045).A059248
Numerator of 1/F(1) + 1/F(2) + 1/F(3) + ... + 1/F(n), where F(n) is the n-th Fibonacci number (A000045).
- Tersum n + (n-1); write n and n-1 in base 3 and add mod 3 with no carries.A059249
Tersum n + (n-1); write n and n-1 in base 3 and add mod 3 with no carries.
- Square array read by antidiagonals: T(k,n) = binomial(n-1, k) + Sum_{i=0..k} binomial(n, i), k >= 1, n >= 0.A059250
Square array read by antidiagonals: T(k,n) = binomial(n-1, k) + Sum_{i=0..k} binomial(n, i), k >= 1, n >= 0.
- A sequence related to numeric partitions and Fermat Coefficients.A059251
A sequence related to numeric partitions and Fermat Coefficients.
- Hilbert's Hamiltonian walk on N X N projected onto x axis: m(3).A059252
Hilbert's Hamiltonian walk on N X N projected onto x axis: m(3).
- Hilbert's Hamiltonian walk on N X N projected onto y axis: m'(3).A059253
Hilbert's Hamiltonian walk on N X N projected onto y axis: m'(3).
- Size of maximal subset of the Sobol sequence (projection of a 0/1-cube with the projection vectors b_i=(i,rev(i)), where rev(i) is the value of the reversed binary representation of i).A059254
Size of maximal subset of the Sobol sequence (projection of a 0/1-cube with the projection vectors b_i=(i,rev(i)), where rev(i) is the value of the reversed binary representation of i).
- Both sum of n+1 consecutive squares and sum of the immediately following n consecutive squares.A059255
Both sum of n+1 consecutive squares and sum of the immediately following n consecutive squares.
- Primes p such that x^29 = 2 has no solution mod p.A059256
Primes p such that x^29 = 2 has no solution mod p.
- Primes p such that x^47 = 2 has no solution mod p.A059257
Primes p such that x^47 = 2 has no solution mod p.
- Primes p such that x^53 = 2 has no solution mod p.A059258
Primes p such that x^53 = 2 has no solution mod p.
- Triangle read by rows giving coefficient T(i,j) of x^i y^j in 1/(1-x-x*y-y^2) = 1/((1+y)(1-x-y)) for (i,j) = (0,0), (1,0), (0,1), (2,0), (1,1), (0,2), ...A059259
Triangle read by rows giving coefficient T(i,j) of x^i y^j in 1/(1-x-x*y-y^2) = 1/((1+y)(1-x-y)) for (i,j) = (0,0), (1,0), (0,1), (2,0), (1,1), (0,2), ...
- Triangle read by rows giving coefficient T(i,j) of x^i y^j in 1/(1-y-x*y-x^2) = 1/((1+x)(1-x-y)) for (i,j) = (0,0), (1,0), (0,1), (2,0), (1,1), (0,2), ...A059260
Triangle read by rows giving coefficient T(i,j) of x^i y^j in 1/(1-y-x*y-x^2) = 1/((1+x)(1-x-y)) for (i,j) = (0,0), (1,0), (0,1), (2,0), (1,1), (0,2), ...