Sequences
392,541 sequences
- Number of staircase polygons of perimeter 2n with 2 (staircase polygon) holes on square lattice (not allowing rotations).A057411
Number of staircase polygons of perimeter 2n with 2 (staircase polygon) holes on square lattice (not allowing rotations).
- Number of staircase polygons of perimeter 2n with 3 (staircase polygon) holes on square lattice (not allowing rotations).A057412
Number of staircase polygons of perimeter 2n with 3 (staircase polygon) holes on square lattice (not allowing rotations).
- Number of staircase polygons of perimeter 2n with any number of (staircase polygon) holes on square lattice (not allowing rotations).A057413
Number of staircase polygons of perimeter 2n with any number of (staircase polygon) holes on square lattice (not allowing rotations).
- Number of staircase polygons of area n with one (staircase polygon) hole on square lattice (not allowing rotations).A057414
Number of staircase polygons of area n with one (staircase polygon) hole on square lattice (not allowing rotations).
- Number of staircase polygons of area n with 2 (staircase polygon) holes on square lattice (not allowing rotations).A057415
Number of staircase polygons of area n with 2 (staircase polygon) holes on square lattice (not allowing rotations).
- Number of staircase polygons of area n with 3 (staircase polygon) holes on square lattice (not allowing rotations).A057416
Number of staircase polygons of area n with 3 (staircase polygon) holes on square lattice (not allowing rotations).
- Number of staircase polygons of area n with any number of (staircase polygon) holes on square lattice (not allowing rotations).A057417
Number of staircase polygons of area n with any number of (staircase polygon) holes on square lattice (not allowing rotations).
- Number of n-celled free polyominoes with 1 hole.A057418
Number of n-celled free polyominoes with 1 hole.
- Number of fixed n-celled polyominoes with 1 hole.A057419
Number of fixed n-celled polyominoes with 1 hole.
- Axially symmetric n-celled polyominoes with 1 hole.A057420
Axially symmetric n-celled polyominoes with 1 hole.
- Consider the solutions to k = a+b = x*y and a*b = k*(x+y) where k, a, b, x, and y are all positive integers, ordered by increasing k and, in case of ties, by increasing x. Sequence gives values of a*b.A057421
Consider the solutions to k = a+b = x*y and a*b = k*(x+y) where k, a, b, x, and y are all positive integers, ordered by increasing k and, in case of ties, by increasing x. Sequence gives values of a*b.
- Number of 2n-celled free polyominoes with 1 hole that are symmetric about two orthogonal axes (and therefore centrally symmetric) but have no other symmetries.A057422
Number of 2n-celled free polyominoes with 1 hole that are symmetric about two orthogonal axes (and therefore centrally symmetric) but have no other symmetries.
- Diagonally symmetric n-celled polyominoes with 1 hole.A057423
Diagonally symmetric n-celled polyominoes with 1 hole.
- Diagonally symmetric (about diagonal 2) 2n-celled polyominoes with 1 hole.A057424
Diagonally symmetric (about diagonal 2) 2n-celled polyominoes with 1 hole.
- Number of 2n-celled free polyominoes with 1 hole that have the 180-degree rotation symmetry and no others.A057425
Number of 2n-celled free polyominoes with 1 hole that have the 180-degree rotation symmetry and no others.
- Number of asymmetric n-celled polyominoes with 1 hole.A057426
Number of asymmetric n-celled polyominoes with 1 hole.
- a(n) = 1 if n > 0, a(n) = 0 if n = 0; series expansion of x/(1-x).A057427
a(n) = 1 if n > 0, a(n) = 0 if n = 0; series expansion of x/(1-x).
- Sign(-n): a(n) = 1 if -n > 0, = -1 if -n < 0, = 0 if n = 0.A057428
Sign(-n): a(n) = 1 if -n > 0, = -1 if -n < 0, = 0 if n = 0.
- Numbers n such that (1+i)^n - 1 times its conjugate is prime.A057429
Numbers n such that (1+i)^n - 1 times its conjugate is prime.
- Number of days in months of Baha'i calendar.A057430
Number of days in months of Baha'i calendar.
- Obtained by reading first the numerator then the denominator of fractions in full Stern-Brocot tree (A007305/A047679).A057431
Obtained by reading first the numerator then the denominator of fractions in full Stern-Brocot tree (A007305/A047679).
- Obtained by reading first the numerator then the denominator of fractions in left-hand half of Stern-Brocot tree (A007305/A007306).A057432
Obtained by reading first the numerator then the denominator of fractions in left-hand half of Stern-Brocot tree (A007305/A007306).
- Erroneous version of A006074.A057433
Erroneous version of A006074.
- a(n) = Sum_{k=1..n} phi(k)^2.A057434
a(n) = Sum_{k=1..n} phi(k)^2.
- Number of letters in the Turkish name of n, excluding spaces and hyphens.A057435
Number of letters in the Turkish name of n, excluding spaces and hyphens.
- Contains digits 1 through 6 only.A057436
Contains digits 1 through 6 only.
- Numbers k such that 10*7^k + 1 is prime.A057437
Numbers k such that 10*7^k + 1 is prime.
- a(1) = 1; a(n+1) = (Product_{k = 1..n} [a(k)]) * (Sum_{j = 1..n} [1/a(j)]).A057438
a(1) = 1; a(n+1) = (Product_{k = 1..n} [a(k)]) * (Sum_{j = 1..n} [1/a(j)]).
- Values of S from sequence A007773.A057439
Values of S from sequence A007773.
- Numbers n such that n*M127 + 1 is prime, where M127 = 2^127 - 1.A057440
Numbers n such that n*M127 + 1 is prime, where M127 = 2^127 - 1.
- n*M127 - 1 is prime, where M127 = 2^127 - 1.A057441
n*M127 - 1 is prime, where M127 = 2^127 - 1.
- For the numbers k that can be expressed as k = w+x = y*z with w*x = (y+z)^2 where w, x, y, and z are all positive integers, this sequence gives the corresponding values of w*x.A057442
For the numbers k that can be expressed as k = w+x = y*z with w*x = (y+z)^2 where w, x, y, and z are all positive integers, this sequence gives the corresponding values of w*x.
- For the numbers k that can be expressed as k = w + x = y*z with w*x = y^3 + z^3 where w, x, y, and z are all positive integers, this sequence gives the corresponding values of w*x.A057443
For the numbers k that can be expressed as k = w + x = y*z with w*x = y^3 + z^3 where w, x, y, and z are all positive integers, this sequence gives the corresponding values of w*x.
- For the numbers k that can be expressed as k = w + x = y*z with w*x = y^2 + z^2 where w, x, y, and z are all positive integers, this sequence gives the corresponding values of w*x.A057444
For the numbers k that can be expressed as k = w + x = y*z with w*x = y^2 + z^2 where w, x, y, and z are all positive integers, this sequence gives the corresponding values of w*x.
- For the numbers k that can be expressed as k = w+x = y*z with w*x = (y+z)^3 where w, x, y, and z are all positive integers, this sequence gives the corresponding values of w*x.A057445
For the numbers k that can be expressed as k = w+x = y*z with w*x = (y+z)^3 where w, x, y, and z are all positive integers, this sequence gives the corresponding values of w*x.
- To get next term, multiply by 13, add 1 and discard any prime factors < 13.A057446
To get next term, multiply by 13, add 1 and discard any prime factors < 13.
- a(n+1) = next prime such that a(n+1)-1 | (a(1)...a(n))^3.A057447
a(n+1) = next prime such that a(n+1)-1 | (a(1)...a(n))^3.
- a(n+1) = next prime such that a(n+1)-1 | (a(1)...a(n))^5.A057448
a(n+1) = next prime such that a(n+1)-1 | (a(1)...a(n))^5.
- Product of differences between consecutive positive divisors of n.A057449
Product of differences between consecutive positive divisors of n.
- Prime recurrence: a(n+1) = a(n)-th prime, with a(1) = 4.A057450
Prime recurrence: a(n+1) = a(n)-th prime, with a(1) = 4.
- Prime recurrence: a(n+1) = a(n)-th prime, with a(1) = 6.A057451
Prime recurrence: a(n+1) = a(n)-th prime, with a(1) = 6.
- Prime recurrence: a(1)=8, a(n+1) = a(n)-th prime.A057452
Prime recurrence: a(1)=8, a(n+1) = a(n)-th prime.
- Prime recurrence: a(n+1) = a(n)-th prime, with a(1) = 9.A057453
Prime recurrence: a(n+1) = a(n)-th prime, with a(1) = 9.
- n*M31 + 1 is prime, where M31 = 2^31 - 1.A057454
n*M31 + 1 is prime, where M31 = 2^31 - 1.
- n*M31 - 1 is prime, where M31 = 2^31 - 1.A057455
n*M31 - 1 is prime, where M31 = 2^31 - 1.
- Prime recurrence: a(n+1) = a(n)-th prime, with a(1) = 10.A057456
Prime recurrence: a(n+1) = a(n)-th prime, with a(1) = 10.
- Prime recurrence: a(n+1) = a(n)-th prime, with a(1) = 12.A057457
Prime recurrence: a(n+1) = a(n)-th prime, with a(1) = 12.
- Number of k, 1 <= k <= n, where {k (n+1-k) + 1} is prime.A057458
Number of k, 1 <= k <= n, where {k (n+1-k) + 1} is prime.
- a(n+1) = smallest prime p in the range a(n) < p < a(1)*a(2)*...*a(n) such that p-1 divides a(1)*a(2)*...*a(n); or if no such prime p exists, then a(n+1) = smallest prime > a(n).A057459
a(n+1) = smallest prime p in the range a(n) < p < a(1)*a(2)*...*a(n) such that p-1 divides a(1)*a(2)*...*a(n); or if no such prime p exists, then a(n+1) = smallest prime > a(n).
- Numbers k such that x^k + x^2 + 1 is irreducible over GF(2).A057460
Numbers k such that x^k + x^2 + 1 is irreducible over GF(2).