Sequences
392,541 sequences
- Beatty sequence for log(Pi).A059561
Beatty sequence for log(Pi).
- Beatty sequence for log(Pi)/(log(Pi)-1).A059562
Beatty sequence for log(Pi)/(log(Pi)-1).
- Beatty sequence for e + 1/e.A059563
Beatty sequence for e + 1/e.
- Beatty sequence for (e^2 + 1)/(e^2 - e + 1).A059564
Beatty sequence for (e^2 + 1)/(e^2 - e + 1).
- Beatty sequence for e^gamma (gamma is the Euler-Mascheroni constant A001620).A059565
Beatty sequence for e^gamma (gamma is the Euler-Mascheroni constant A001620).
- Beatty sequence for e^gamma/(e^gamma-1).A059566
Beatty sequence for e^gamma/(e^gamma-1).
- Beatty sequence for 1 - log(log(2)).A059567
Beatty sequence for 1 - log(log(2)).
- Beatty sequence for 1 - 1/log(log(2)).A059568
Beatty sequence for 1 - 1/log(log(2)).
- Numbers k such that (7*3^k - 5)/2 is prime.A059569
Numbers k such that (7*3^k - 5)/2 is prime.
- Number of fixed points in all 231-avoiding involutions in S_n.A059570
Number of fixed points in all 231-avoiding involutions in S_n.
- From Mertens's conjecture (1): floor(sqrt(n)) - |M(n)|, where M is Mertens's function A002321.A059571
From Mertens's conjecture (1): floor(sqrt(n)) - |M(n)|, where M is Mertens's function A002321.
- From Mertens's conjecture (2): floor(sqrt(n)) - Mertens's function A002321(n).A059572
From Mertens's conjecture (2): floor(sqrt(n)) - Mertens's function A002321(n).
- Polyotessamino numbers T(n,k) (1<=k<=n): take all the polyominoes with n cells (including those with holes but excluding rotations and reflections); fill them as completely as possible with rectangular 1 X k tiles; T(n,k) is number of ways of doing this.A059573
Polyotessamino numbers T(n,k) (1<=k<=n): take all the polyominoes with n cells (including those with holes but excluding rotations and reflections); fill them as completely as possible with rectangular 1 X k tiles; T(n,k) is number of ways of doing this.
- The array described in A059513 read by antidiagonals in the 'up' direction.A059574
The array described in A059513 read by antidiagonals in the 'up' direction.
- The array described in A059513 read by antidiagonals in the direction of construction.A059575
The array described in A059513 read by antidiagonals in the direction of construction.
- Summatory Pascal triangle T(n,k) (0 <= k <= n) read by rows. Top entry is 1. Each entry is the sum of the parallelogram above it.A059576
Summatory Pascal triangle T(n,k) (0 <= k <= n) read by rows. Top entry is 1. Each entry is the sum of the parallelogram above it.
- Main diagonal of the array A059574.A059577
Main diagonal of the array A059574.
- Variation of Boustrophedon transform applied to 1,1,1,1,... Fill an array by diagonals, all in the 'up' direction. The first column is 1,1,1,1,.... 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 first row gives a(n).A059578
Variation of Boustrophedon transform applied to 1,1,1,1,... Fill an array by diagonals, all in the 'up' direction. The first column is 1,1,1,1,.... 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 first row gives a(n).
- The array of A059578 read by antidiagonals in the 'up' direction.A059579
The array of A059578 read by antidiagonals in the 'up' direction.
- Main diagonal of the array A059579.A059580
Main diagonal of the array A059579.
- From Von Sterneck's conjecture: floor(sqrt(n)) - 2*|Mertens's function A002321(n)|.A059581
From Von Sterneck's conjecture: floor(sqrt(n)) - 2*|Mertens's function A002321(n)|.
- First differences give digits of Pi = 3.1415926...A059582
First differences give digits of Pi = 3.1415926...
- Each c(i) is "multiply" (*) or "divide" (/); a(n) is number of choices for c(1),..,c(n) so that the reduced fraction 1 c(1) 2 c(2) 3 c(3) 5 ... c(n) prime(n) is equal to (k*m+1)/m for a positive integer m and a nonnegative integer k.A059583
Each c(i) is "multiply" (*) or "divide" (/); a(n) is number of choices for c(1),..,c(n) so that the reduced fraction 1 c(1) 2 c(2) 3 c(3) 5 ... c(n) prime(n) is equal to (k*m+1)/m for a positive integer m and a nonnegative integer k.
- Triangle T(n,m) of number of labeled m-node T_0-hypergraphs with n hyperedges (empty hyperedges and multiple hyperedges included), m=0,1,...,2^n.A059584
Triangle T(n,m) of number of labeled m-node T_0-hypergraphs with n hyperedges (empty hyperedges and multiple hyperedges included), m=0,1,...,2^n.
- Number of labeled 3-node T_0-hypergraphs with n hyperedges (empty hyperedges and multiple hyperedges included).A059585
Number of labeled 3-node T_0-hypergraphs with n hyperedges (empty hyperedges and multiple hyperedges included).
- Number of labeled T_0-hypergraphs with n hyperedges (empty hyperedges and multiple hyperedges included).A059586
Number of labeled T_0-hypergraphs with n hyperedges (empty hyperedges and multiple hyperedges included).
- T(n,m) = (1/m!)*Sum_{i=0..m} stirling1(m,i)*(2^i)*(2^i+1)*...*(2^i+n-1).A059587
T(n,m) = (1/m!)*Sum_{i=0..m} stirling1(m,i)*(2^i)*(2^i+1)*...*(2^i+n-1).
- a(n)=Sum_{i=0..n} |stirling1(n,i)|*2^(2^i).A059588
a(n)=Sum_{i=0..n} |stirling1(n,i)|*2^(2^i).
- Sums of factorials of distinct integers.A059589
Sums of factorials of distinct integers.
- Numbers obtained by reinterpreting base-2 representation of n in the factorial base: a(n) = Sum_{k>=0} A030308(n,k)*A000142(k+1).A059590
Numbers obtained by reinterpreting base-2 representation of n in the factorial base: a(n) = Sum_{k>=0} A030308(n,k)*A000142(k+1).
- Squarefree part of n^2+1.A059591
Squarefree part of n^2+1.
- Square-full part of n^2 + 1.A059592
Square-full part of n^2 + 1.
- Number of degree-n permutations of order exactly 5.A059593
Number of degree-n permutations of order exactly 5.
- Convolution triangle based on A008619 (positive integers repeated).A059594
Convolution triangle based on A008619 (positive integers repeated).
- Seventh column (m=6) of convolution triangle A059594(n,m).A059595
Seventh column (m=6) of convolution triangle A059594(n,m).
- Eighth column (m=7) of convolution triangle A059594(n,m).A059596
Eighth column (m=7) of convolution triangle A059594(n,m).
- Ninth column (m=8) of convolution triangle A059594(n,m).A059597
Ninth column (m=8) of convolution triangle A059594(n,m).
- Tenth column (m=9) of convolution triangle A059594(n,m).A059598
Tenth column (m=9) of convolution triangle A059594(n,m).
- Expansion of (3+x)/(1-x)^6.A059599
Expansion of (3+x)/(1-x)^6.
- Expansion of (1+6*x+x^2)/(1-x)^8.A059600
Expansion of (1+6*x+x^2)/(1-x)^8.
- Expansion of (1+10*x+5*x^2)/(1-x)^10.A059601
Expansion of (1+10*x+5*x^2)/(1-x)^10.
- Expansion of (5+10*x+x^2)/(1-x)^10.A059602
Expansion of (5+10*x+x^2)/(1-x)^10.
- Expansion of (1+15*x+15*x^2+x^3)/(1-x)^12.A059603
Expansion of (1+15*x+15*x^2+x^3)/(1-x)^12.
- Coefficients of polynomials (n-1)!*P(n,k), P(n,k) = Sum_{i=0..n} Stirling2(n,i)*binomial(k+i-1,k).A059604
Coefficients of polynomials (n-1)!*P(n,k), P(n,k) = Sum_{i=0..n} Stirling2(n,i)*binomial(k+i-1,k).
- a(n) = (1/3!)*(n^3 + 24*n^2 + 107*n + 90), compare A059604.A059605
a(n) = (1/3!)*(n^3 + 24*n^2 + 107*n + 90), compare A059604.
- Expansion of (1/2)*(exp(2*x)-1)*exp(exp(x)-1).A059606
Expansion of (1/2)*(exp(2*x)-1)*exp(exp(x)-1).
- As an upper right triangle, number of distinct partitions of n where the highest part is k (0<=k<=n).A059607
As an upper right triangle, number of distinct partitions of n where the highest part is k (0<=k<=n).
- Numbers k such that 2^k - 5 is prime.A059608
Numbers k such that 2^k - 5 is prime.
- Numbers k such that 2^k - 7 is prime.A059609
Numbers k such that 2^k - 7 is prime.
- Numbers k such that 2^k - 9 is prime.A059610
Numbers k such that 2^k - 9 is prime.