Sequences
392,541 sequences
- Smallest number containing in its binary representation substrings forming an arithmetic progression exactly of size n.A091461
Smallest number containing in its binary representation substrings forming an arithmetic progression exactly of size n.
- a(n) is the smallest j such that 1/3 + 1/6 + 1/9 + ... + 1/j exceeds n.A091462
a(n) is the smallest j such that 1/3 + 1/6 + 1/9 + ... + 1/j exceeds n.
- a(n) is the smallest j such that 1/1 + 1/4 + 1/7 + ... + 1/j exceeds n.A091463
a(n) is the smallest j such that 1/1 + 1/4 + 1/7 + ... + 1/j exceeds n.
- a(n) is the smallest j such that 1/2 + 1/5 + 1/8 + ... + 1/j exceeds n.A091464
a(n) is the smallest j such that 1/2 + 1/5 + 1/8 + ... + 1/j exceeds n.
- Smallest prime with digit product 6^n.A091465
Smallest prime with digit product 6^n.
- Table (by antidiagonals) of labeled alternating octopuses with n black nodes and k white nodes. Each type of object labeled from its own label set.A091466
Table (by antidiagonals) of labeled alternating octopuses with n black nodes and k white nodes. Each type of object labeled from its own label set.
- Table (by antidiagonals) of unlabeled alternating octopuses with n black nodes and k white nodes.A091467
Table (by antidiagonals) of unlabeled alternating octopuses with n black nodes and k white nodes.
- Number of unlabeled alternating octopuses with n black nodes and n white nodes.A091468
Number of unlabeled alternating octopuses with n black nodes and n white nodes.
- Number of unlabeled alternating octopuses with n black nodes.A091469
Number of unlabeled alternating octopuses with n black nodes.
- Number of n X n matrices with entries {-1,0,1} that are diagonalizable over the complex numbers.A091470
Number of n X n matrices with entries {-1,0,1} that are diagonalizable over the complex numbers.
- Number of n X n matrices with entries {-1,1} that are diagonalizable over the complex numbers.A091471
Number of n X n matrices with entries {-1,1} that are diagonalizable over the complex numbers.
- Number of n X n matrices with entries {0,1} that are diagonalizable over the complex numbers.A091472
Number of n X n matrices with entries {0,1} that are diagonalizable over the complex numbers.
- Integral_{x>=0} (cos(2x) * Product_{n>=1} cos(x/n)) dx.A091473
Integral_{x>=0} (cos(2x) * Product_{n>=1} cos(x/n)) dx.
- Decimal expansion of Pi^2 * (2-sqrt(2))/32.A091474
Decimal expansion of Pi^2 * (2-sqrt(2))/32.
- Decimal expansion of Catalan - Pi^2/16 + Pi*log(2)/4.A091475
Decimal expansion of Catalan - Pi^2/16 + Pi*log(2)/4.
- Decimal expansion of Pi^2/4.A091476
Decimal expansion of Pi^2/4.
- Decimal expansion of (3*Catalan*Pi)/4 - Pi^3/64 + (Pi^2*log(64))/64 - (105*zeta(3))/64.A091477
Decimal expansion of (3*Catalan*Pi)/4 - Pi^3/64 + (Pi^2*log(64))/64 - (105*zeta(3))/64.
- Table of graphs with n (>=0) nodes and k (>=0) edges. Each type of object labeled from its own label set.A091478
Table of graphs with n (>=0) nodes and k (>=0) edges. Each type of object labeled from its own label set.
- Number of graphs with n nodes. Nodes and edges labeled each from their own label set.A091479
Number of graphs with n nodes. Nodes and edges labeled each from their own label set.
- Table of multigraphs (by antidiagonals) with n (>=1) nodes and k (>=0) edges. Each type of object labeled from its own label set.A091480
Table of multigraphs (by antidiagonals) with n (>=1) nodes and k (>=0) edges. Each type of object labeled from its own label set.
- Number of labeled rooted 2,3 cacti (triangular cacti with bridges).A091481
Number of labeled rooted 2,3 cacti (triangular cacti with bridges).
- a(n) = (3*n)^n.A091482
a(n) = (3*n)^n.
- a(n) = (4*n)^n.A091483
a(n) = (4*n)^n.
- Recamán's Fibonacci variation : a(1)=a(2)=1 then a(n) = a(n-1)+a(n-2)-F(n) if that number is >0 and not already in the sequence; a(n) = a(n-1)+a(n-2)+F(n) otherwise where F(n) denotes the n-th Fibonacci number.A091484
Recamán's Fibonacci variation : a(1)=a(2)=1 then a(n) = a(n-1)+a(n-2)-F(n) if that number is >0 and not already in the sequence; a(n) = a(n-1)+a(n-2)+F(n) otherwise where F(n) denotes the n-th Fibonacci number.
- Number of labeled 2,3 cacti (triangular cacti with bridges).A091485
Number of labeled 2,3 cacti (triangular cacti with bridges).
- Number of unlabeled rooted 2,3 cacti (triangular cacti with bridges).A091486
Number of unlabeled rooted 2,3 cacti (triangular cacti with bridges).
- Number of unlabeled 2,3 cacti (triangular cacti with bridges).A091487
Number of unlabeled 2,3 cacti (triangular cacti with bridges).
- Number of asymmetric rooted 2,3 cacti (triangular cacti with bridges).A091488
Number of asymmetric rooted 2,3 cacti (triangular cacti with bridges).
- Number of asymmetric 2,3 cacti (triangular cacti with bridges).A091489
Number of asymmetric 2,3 cacti (triangular cacti with bridges).
- Primes p such that all prime divisors of p^2 + p + 1 are less than p.A091490
Primes p such that all prime divisors of p^2 + p + 1 are less than p.
- Triangle, read by rows, where the n-th diagonal is generated from the n-th row by the sum of the products of the n-th row terms with binomial coefficients.A091491
Triangle, read by rows, where the n-th diagonal is generated from the n-th row by the sum of the products of the n-th row terms with binomial coefficients.
- Triangle, read by rows, generated recursively and related to partitions.A091492
Triangle, read by rows, generated recursively and related to partitions.
- Row sums of triangle A091492.A091493
Row sums of triangle A091492.
- Decimal expansion of the difference between Pi/8 (A019675) and A091473.A091494
Decimal expansion of the difference between Pi/8 (A019675) and A091473.
- Odd squarefree numbers k such that k/phi(k) > 2, where phi is Euler's totient function.A091495
Odd squarefree numbers k such that k/phi(k) > 2, where phi is Euler's totient function.
- a(n) = ((5*n)!/(n!*(2*n)!))*(Gamma(1+n/2)/Gamma(1+5*n/2)).A091496
a(n) = ((5*n)!/(n!*(2*n)!))*(Gamma(1+n/2)/Gamma(1+5*n/2)).
- Number of nonzero terms in the n-th row of triangle A091492.A091497
Number of nonzero terms in the n-th row of triangle A091492.
- The sixth column of triangle A091492, excluding leading zeros.A091498
The sixth column of triangle A091492, excluding leading zeros.
- Triangle read by rows, such that T(n,k) equals the k-th term of the convolution of the two prior rows indexed by (n-k) and (k-1).A091499
Triangle read by rows, such that T(n,k) equals the k-th term of the convolution of the two prior rows indexed by (n-k) and (k-1).
- Convergent of rows in triangle A091499, in which A091499(n,k) equals the k-th term of the convolution of the two prior rows indexed by (n-k) and (k-1).A091500
Convergent of rows in triangle A091499, in which A091499(n,k) equals the k-th term of the convolution of the two prior rows indexed by (n-k) and (k-1).
- Row sums of triangle A091499, in which A091499(n,k) equals the k-th term of the convolution of the two prior rows indexed by (n-k) and (k-1).A091501
Row sums of triangle A091499, in which A091499(n,k) equals the k-th term of the convolution of the two prior rows indexed by (n-k) and (k-1).
- Number of n X n matrices with entries {-1,0,1} that are diagonalizable over the real numbers.A091502
Number of n X n matrices with entries {-1,0,1} that are diagonalizable over the real numbers.
- Number of n X n matrices with entries {-1,1} that are diagonalizable over the real numbers.A091503
Number of n X n matrices with entries {-1,1} that are diagonalizable over the real numbers.
- Number of n X n matrices with entries {0,1} that are diagonalizable over the real numbers.A091504
Number of n X n matrices with entries {0,1} that are diagonalizable over the real numbers.
- Decimal expansion of (2 + sqrt(2) + 5*arcsinh(1))/15.A091505
Decimal expansion of (2 + sqrt(2) + 5*arcsinh(1))/15.
- Decimal expansion of (2 + sqrt(2) + 5*arcsinh(1))/9.A091506
Decimal expansion of (2 + sqrt(2) + 5*arcsinh(1))/9.
- Product of the anti-divisors of n.A091507
Product of the anti-divisors of n.
- Let b(1)=n; b(k+1)=b(k)/gcd(k,b(k)) if gcd(k,b(k))>1; b(k+1)=b(k)+k otherwise, sequence gives least k such that b(k)=1.A091508
Let b(1)=n; b(k+1)=b(k)/gcd(k,b(k)) if gcd(k,b(k))>1; b(k+1)=b(k)+k otherwise, sequence gives least k such that b(k)=1.
- Numbers (in ascending order, without multiplicity) which occur in triples a,b,c such that a < b < c, (b * c) / (b + c) leaves a, (a * c) / (a + c) leaves b and (a * b) / (a + b) leaves c as a remainder.A091509
Numbers (in ascending order, without multiplicity) which occur in triples a,b,c such that a < b < c, (b * c) / (b + c) leaves a, (a * c) / (a + c) leaves b and (a * b) / (a + b) leaves c as a remainder.
- Number of nonisomorphic algebras with a ternary operation (3-d groupoids) with n elements.A091510
Number of nonisomorphic algebras with a ternary operation (3-d groupoids) with n elements.