Sequences
392,541 sequences
- Main diagonal of the array A059217.A059511
Main diagonal of the array A059217.
- For n>=2, the number of (s(0), s(1), ..., s(n-1)) such that 0 < s(i) < 5 and |s(i) - s(i-1)| <= 1 for i = 1,2,....,n-1, s(0) = 2, s(n-1) = 2.A059512
For n>=2, the number of (s(0), s(1), ..., s(n-1)) such that 0 < s(i) < 5 and |s(i) - s(i-1)| <= 1 for i = 1,2,....,n-1, s(0) = 2, s(n-1) = 2.
- Variation of Boustrophedon transform applied to 1,1,1,1,... Fill an array by diagonals, in alternating directions. The first entry is 1 each time. For the next element of a diagonal, add to the previous element the elements of the row and the column the new element is in. The final element of each diagonal gives a(n).A059513
Variation of Boustrophedon transform applied to 1,1,1,1,... Fill an array by diagonals, in alternating directions. The first entry is 1 each time. For the next element of a diagonal, add to the previous element the elements of the row and the column the new element is in. The final element of each diagonal gives a(n).
- For a rational number p/q let f(p/q) = p*q divided by (the sum of digits of p and of q) minus 1; a(n) is obtained by iterating f, starting at n/1, until an integer is reached, or if no integer is ever reached then a(n) = 0.A059514
For a rational number p/q let f(p/q) = p*q divided by (the sum of digits of p and of q) minus 1; a(n) is obtained by iterating f, starting at n/1, until an integer is reached, or if no integer is ever reached then a(n) = 0.
- Square array T(k,n) by antidiagonals, where T(k,n) is number of ways of placing n identifiable nonnegative intervals with a total of exactly k starting and/or finishing points.A059515
Square array T(k,n) by antidiagonals, where T(k,n) is number of ways of placing n identifiable nonnegative intervals with a total of exactly k starting and/or finishing points.
- Number of different relations between n intervals (possibly of zero length) on a line.A059516
Number of different relations between n intervals (possibly of zero length) on a line.
- The sequence A059515(3,n). Number of ways of placing n identifiable nonnegative intervals with a total of exactly three starting and/or finishing points.A059517
The sequence A059515(3,n). Number of ways of placing n identifiable nonnegative intervals with a total of exactly three starting and/or finishing points.
- a(n)/n^2 is the minimal average squared Euclidean distance of n points to their center of gravity among all configurations of n points on the hexagonal lattice.A059518
a(n)/n^2 is the minimal average squared Euclidean distance of n points to their center of gravity among all configurations of n points on the hexagonal lattice.
- Number of partitions of n all of whose subpartitions sum to distinct values. Partition(n) = [a, b, c...] where 2n = 2^a + 2^b + 2^c + ...A059519
Number of partitions of n all of whose subpartitions sum to distinct values. Partition(n) = [a, b, c...] where 2n = 2^a + 2^b + 2^c + ...
- Number of partitions into distinct parts, with some sub-partitions having equal sums. Partition(n) = [a, b, c...] where 2n = 2^a + 2^b + 2^c + ...A059520
Number of partitions into distinct parts, with some sub-partitions having equal sums. Partition(n) = [a, b, c...] where 2n = 2^a + 2^b + 2^c + ...
- 5, followed by the digits of the cubes of each term.A059521
5, followed by the digits of the cubes of each term.
- a(1) = 1, then a(n) = n*(n^(n-1)-1)*(n-2)!/(n-1).A059522
a(1) = 1, then a(n) = n*(n^(n-1)-1)*(n-2)!/(n-1).
- Number of n-element unlabeled ordered T_0-antichains without isolated vertices; number of T_1-hypergraphs (without empty edge and without multiple edges) on n labeled vertices.A059523
Number of n-element unlabeled ordered T_0-antichains without isolated vertices; number of T_1-hypergraphs (without empty edge and without multiple edges) on n labeled vertices.
- Number of nonzero 4 X n binary arrays with all 1's connected.A059524
Number of nonzero 4 X n binary arrays with all 1's connected.
- Number of nonzero n X n binary arrays with all 1's connected.A059525
Number of nonzero n X n binary arrays with all 1's connected.
- Decimal expansion of real part of solution to z = log z.A059526
Decimal expansion of real part of solution to z = log z.
- Decimal expansion of imaginary part of solution to z = log z.A059527
Decimal expansion of imaginary part of solution to z = log z.
- Numbers k such that (7*3^k + 5)/2 is prime.A059528
Numbers k such that (7*3^k + 5)/2 is prime.
- For 1 < x, each c(i) is "multiply" (*) or "divide" (/); a(n) is number of choices for c(0),...,c(n-1) so that 1 c(0) x^1 c(1) x^2,.., c(n-1) x^n is an integer.A059529
For 1 < x, each c(i) is "multiply" (*) or "divide" (/); a(n) is number of choices for c(0),...,c(n-1) so that 1 c(0) x^1 c(1) x^2,.., c(n-1) x^n is an integer.
- Triangle T(n,k) of k-block T_0-tricoverings of an n-set, n >= 3, k = 0..2*n.A059530
Triangle T(n,k) of k-block T_0-tricoverings of an n-set, n >= 3, k = 0..2*n.
- Beatty sequence for 1 + 1/Pi.A059531
Beatty sequence for 1 + 1/Pi.
- Beatty sequence for 1 + Pi.A059532
Beatty sequence for 1 + Pi.
- Beatty sequence for 1 + Catalan's constant.A059533
Beatty sequence for 1 + Catalan's constant.
- Beatty sequence for 1 + 1/Catalan's constant.A059534
Beatty sequence for 1 + 1/Catalan's constant.
- Beatty sequence for Pi^2/6, or zeta(2).A059535
Beatty sequence for Pi^2/6, or zeta(2).
- Beatty sequence for zeta(2)/(zeta(2)-1).A059536
Beatty sequence for zeta(2)/(zeta(2)-1).
- Beatty sequence for zeta(3).A059537
Beatty sequence for zeta(3).
- Beatty sequence for zeta(3)/(zeta(3)-1).A059538
Beatty sequence for zeta(3)/(zeta(3)-1).
- Beatty sequence for 3^(1/3).A059539
Beatty sequence for 3^(1/3).
- Beatty sequence for 3^(1/3)/(3^(1/3)-1).A059540
Beatty sequence for 3^(1/3)/(3^(1/3)-1).
- Beatty sequence for 1 + log(2).A059541
Beatty sequence for 1 + log(2).
- Beatty sequence for 1 + 1/log(2).A059542
Beatty sequence for 1 + 1/log(2).
- Beatty sequence for log(3).A059543
Beatty sequence for log(3).
- Beatty sequence for log(3)/(log(3)-1).A059544
Beatty sequence for log(3)/(log(3)-1).
- Beatty sequence for log(10).A059545
Beatty sequence for log(10).
- Beatty sequence for log(10)/(log(10)-1).A059546
Beatty sequence for log(10)/(log(10)-1).
- Beatty sequence for 1 + 1/log(3).A059547
Beatty sequence for 1 + 1/log(3).
- Beatty sequence for 1 + log(3).A059548
Beatty sequence for 1 + log(3).
- Beatty sequence for 1 + 1/log(10).A059549
Beatty sequence for 1 + 1/log(10).
- Beatty sequence for 1 + log(10).A059550
Beatty sequence for 1 + log(10).
- Beatty sequence for Gamma(1/3).A059551
Beatty sequence for Gamma(1/3).
- Beatty sequence for Gamma(1/3)/(Gamma(1/3)-1).A059552
Beatty sequence for Gamma(1/3)/(Gamma(1/3)-1).
- Beatty sequence for Gamma(2/3).A059553
Beatty sequence for Gamma(2/3).
- Beatty sequence for Gamma(2/3)/(Gamma(2/3)-1).A059554
Beatty sequence for Gamma(2/3)/(Gamma(2/3)-1).
- Beatty sequence for 1 + gamma A001620.A059555
Beatty sequence for 1 + gamma A001620.
- Beatty sequence for 1 + 1/gamma.A059556
Beatty sequence for 1 + 1/gamma.
- Beatty sequence for 1 + gamma^2, (gamma is the Euler-Mascheroni constant A001620).A059557
Beatty sequence for 1 + gamma^2, (gamma is the Euler-Mascheroni constant A001620).
- Beatty sequence for 1 + 1/gamma^2.A059558
Beatty sequence for 1 + 1/gamma^2.
- Beatty sequence for 1 + log(1/gamma), (gamma is the Euler-Mascheroni constant A001620).A059559
Beatty sequence for 1 + log(1/gamma), (gamma is the Euler-Mascheroni constant A001620).
- Beatty sequence for 1 - 1/log(gamma).A059560
Beatty sequence for 1 - 1/log(gamma).