Sequences
392,541 sequences
- Number of equivalence classes of self-dual Boolean functions of n variables under action of LSD(n,2).A049461
Number of equivalence classes of self-dual Boolean functions of n variables under action of LSD(n,2).
- a(n) is the smallest n-digit prime p such that the concatenation a(1)a(2)...a(n-1)p is prime, with a(1) = 2.A049462
a(n) is the smallest n-digit prime p such that the concatenation a(1)a(2)...a(n-1)p is prime, with a(1) = 2.
- Number of basic interval orders of length n.A049463
Number of basic interval orders of length n.
- Number of n-photon quenched skeletons.A049464
Number of n-photon quenched skeletons.
- Replace each fraction p/q in Farey tree A007305/A007306 with 2p + q.A049465
Replace each fraction p/q in Farey tree A007305/A007306 with 2p + q.
- Replace each fraction p/q in Farey tree A007305/A007306 with 3p+q.A049466
Replace each fraction p/q in Farey tree A007305/A007306 with 3p+q.
- Replace each fraction p/q in Farey tree A007305/A007306 with 4p+q.A049467
Replace each fraction p/q in Farey tree A007305/A007306 with 4p+q.
- Replace each fraction p/q in Farey tree A007305/A007306 with p+2q.A049468
Replace each fraction p/q in Farey tree A007305/A007306 with p+2q.
- Decimal expansion of sin(1).A049469
Decimal expansion of sin(1).
- Decimal expansion of cos(1).A049470
Decimal expansion of cos(1).
- Decimal expansion of tan(1).A049471
Decimal expansion of tan(1).
- a(n) = floor(n/sqrt(2)).A049472
a(n) = floor(n/sqrt(2)).
- Nearest integer to n/sqrt(2).A049473
Nearest integer to n/sqrt(2).
- a(n) = ceiling(n/sqrt(2)).A049474
a(n) = ceiling(n/sqrt(2)).
- Number of 2n X 2n matrices whose entries are {0,-1,+1} and whose row sums and column sums are all distinct.A049475
Number of 2n X 2n matrices whose entries are {0,-1,+1} and whose row sums and column sums are all distinct.
- Positions of records in A346778.A049476
Positions of records in A346778.
- For each record-breaking row, m, of A088643, the sequence gives the length, k, of the longest earlier row contained in row m.A049477
For each record-breaking row, m, of A088643, the sequence gives the length, k, of the longest earlier row contained in row m.
- Record values in A346778.A049478
Record values in A346778.
- Smallest prime dividing 2^n - 1.A049479
Smallest prime dividing 2^n - 1.
- a(n) = (2*n-1)*(n^2 -n +6)/6.A049480
a(n) = (2*n-1)*(n^2 -n +6)/6.
- Primes p such that p + 30 is also prime.A049481
Primes p such that p + 30 is also prime.
- Primes p such that p + 210 is also prime.A049482
Primes p such that p + 210 is also prime.
- Primes p such that p + 2310 is also prime, where 2310 is the 5th primorial number A002110(5).A049483
Primes p such that p + 2310 is also prime, where 2310 is the 5th primorial number A002110(5).
- Primes p such that p + 30030 is also prime, where 30030 is the 6th primorial number A002110(6).A049484
Primes p such that p + 30030 is also prime, where 30030 is the 6th primorial number A002110(6).
- Primes p such that p + 510510 is also prime, where 510510 is the 7th primorial number A002110(7).A049485
Primes p such that p + 510510 is also prime, where 510510 is the 7th primorial number A002110(7).
- Maximum length of non-crossing path on n X n square lattice.A049486
Maximum length of non-crossing path on n X n square lattice.
- Number of maximal-length non-crossing paths on n X n square lattice.A049487
Number of maximal-length non-crossing paths on n X n square lattice.
- Primes p such that p+16 is prime.A049488
Primes p such that p+16 is prime.
- Primes p such that p + 32 is also prime.A049489
Primes p such that p + 32 is also prime.
- a(n) and a(n)+64 both prime.A049490
a(n) and a(n)+64 both prime.
- Numbers k such that k and k+128 are both prime.A049491
Numbers k such that k and k+128 are both prime.
- Primes p such that p+4 and p+16 are also primes.A049492
Primes p such that p+4 and p+16 are also primes.
- Numbers n such that n and n+4^k are all primes for k=1,2,3.A049493
Numbers n such that n and n+4^k are all primes for k=1,2,3.
- a(n) and a(n)+4^k are primes at least for k=1,2,3,4.A049494
a(n) and a(n)+4^k are primes at least for k=1,2,3,4.
- a(n) and a(n)+4^k are primes at least for k=1,2,3,4,5.A049495
a(n) and a(n)+4^k are primes at least for k=1,2,3,4,5.
- a(n) and a(n)+4^k are primes at least for k=1,2,3,4,5,6.A049496
a(n) and a(n)+4^k are primes at least for k=1,2,3,4,5,6.
- a(n) and a(n)+4^k are primes at least for k=1,2,3,4,5,6,7.A049497
a(n) and a(n)+4^k are primes at least for k=1,2,3,4,5,6,7.
- a(n) and a(n)+4^k are primes at least for k=1,2,3,4,5,6,7,8.A049498
a(n) and a(n)+4^k are primes at least for k=1,2,3,4,5,6,7,8.
- A finite sequence of primes: the primes 671353+4^k for k=1, 2, 3, 4, 5, 6, 7, 8, 9.A049499
A finite sequence of primes: the primes 671353+4^k for k=1, 2, 3, 4, 5, 6, 7, 8, 9.
- Smallest prime p such that p + 4^k is also prime for all k = 1, ..., n.A049500
Smallest prime p such that p + 4^k is also prime for all k = 1, ..., n.
- Major index of n, first definition.A049501
Major index of n, first definition.
- Major index of n, 2nd definition.A049502
Major index of n, 2nd definition.
- a(n) = A005130(n)^2.A049503
a(n) = A005130(n)^2.
- a(n) = Product_{i = 0..n-1} ((3*i+1)!*(6*i)!*(2*i)!)/((4*i)!*(4*i+1)!).A049504
a(n) = Product_{i = 0..n-1} ((3*i+1)!*(6*i)!*(2*i)!)/((4*i)!*(4*i+1)!).
- a(n) = Product_{1<=i<=j<=n} (i+j+n-1)/(i+j-1), number of symmetric plane partitions in n-cube.A049505
a(n) = Product_{1<=i<=j<=n} (i+j+n-1)/(i+j-1), number of symmetric plane partitions in n-cube.
- a(1)=1, a(2)=5, a(n+1) = 2^phi(a(1)*a(2)*...*a(n)) - 3.A049506
a(1)=1, a(2)=5, a(n+1) = 2^phi(a(1)*a(2)*...*a(n)) - 3.
- Number of perfect matchings in graph P_{6} x P_{6} x P_{n}.A049507
Number of perfect matchings in graph P_{6} x P_{6} x P_{n}.
- Numbers k such that prime(k) == 3 (mod 10).A049508
Numbers k such that prime(k) == 3 (mod 10).
- Numbers k such that prime(k) == 7 (mod 10).A049509
Numbers k such that prime(k) == 7 (mod 10).
- Numbers k such that prime(k) == 9 (mod 10).A049510
Numbers k such that prime(k) == 9 (mod 10).