Sequences
392,541 sequences
- Denominators of the Egyptian fraction for the fractional part of Feigenbaum's constant, 4.6692...A069261
Denominators of the Egyptian fraction for the fractional part of Feigenbaum's constant, 4.6692...
- a(n) = 4*prime(n)^2.A069262
a(n) = 4*prime(n)^2.
- (Sum of digits of n)^3 = sum of digits of n^3.A069263
(Sum of digits of n)^3 = sum of digits of n^3.
- Inverse Moebius transform of bigomega(n).A069264
Inverse Moebius transform of bigomega(n).
- Numbers k such that Sum_{d|k} d/core(d) > k, where core(d) is the squarefree part of d.A069265
Numbers k such that Sum_{d|k} d/core(d) > k, where core(d) is the squarefree part of d.
- Numbers k such that Sum_{d|k} d/core(d) > 2*k, where core(d) is the squarefree part of d.A069266
Numbers k such that Sum_{d|k} d/core(d) > 2*k, where core(d) is the squarefree part of d.
- a(n) = (2^(n-1)/(2n)!)*Product_{k=1..n} q(k) where q(n) is the denominator of B(2n), the 2n-th Bernoulli number.A069267
a(n) = (2^(n-1)/(2n)!)*Product_{k=1..n} q(k) where q(n) is the denominator of B(2n), the 2n-th Bernoulli number.
- Greatest common divisor of n! and n*(n+1)/2.A069268
Greatest common divisor of n! and n*(n+1)/2.
- Second level generalization of Catalan triangle (0th level is Pascal's triangle A007318; first level is Catalan triangle A009766; 3rd level is A069270).A069269
Second level generalization of Catalan triangle (0th level is Pascal's triangle A007318; first level is Catalan triangle A009766; 3rd level is A069270).
- Third level generalization of Catalan triangle (0th level is Pascal's triangle A007318; first level is Catalan triangle A009766; 2nd level is A069269).A069270
Third level generalization of Catalan triangle (0th level is Pascal's triangle A007318; first level is Catalan triangle A009766; 2nd level is A069269).
- a(n) = binomial(4*n+1,n)*2/(3*n+2).A069271
a(n) = binomial(4*n+1,n)*2/(3*n+2).
- 11-almost primes (generalization of semiprimes).A069272
11-almost primes (generalization of semiprimes).
- 12-almost primes (generalization of semiprimes).A069273
12-almost primes (generalization of semiprimes).
- 13-almost primes (generalization of semiprimes).A069274
13-almost primes (generalization of semiprimes).
- 14-almost primes (generalization of semiprimes).A069275
14-almost primes (generalization of semiprimes).
- 15-almost primes (generalization of semiprimes).A069276
15-almost primes (generalization of semiprimes).
- 16-almost primes (generalization of semiprimes).A069277
16-almost primes (generalization of semiprimes).
- 17-almost primes (generalization of semiprimes).A069278
17-almost primes (generalization of semiprimes).
- Products of exactly 18 primes (generalization of semiprimes).A069279
Products of exactly 18 primes (generalization of semiprimes).
- 19-almost primes (generalization of semiprimes).A069280
19-almost primes (generalization of semiprimes).
- 20-almost primes (generalization of semiprimes).A069281
20-almost primes (generalization of semiprimes).
- Numbers n such that phi(reversal(n)) = reversal(phi(n)). Ignore leading 0's.A069282
Numbers n such that phi(reversal(n)) = reversal(phi(n)). Ignore leading 0's.
- a(n) = -1 + number of odd divisors of n.A069283
a(n) = -1 + number of odd divisors of n.
- Decimal expansion of li(2) = gamma + log(log(2)) + Sum_{k>=1} log(2)^k / ( k*k! ).A069284
Decimal expansion of li(2) = gamma + log(log(2)) + Sum_{k>=1} log(2)^k / ( k*k! ).
- Continued fraction for Li(2).A069285
Continued fraction for Li(2).
- Decimal expansion of constant rho satisfying Gaussian Phi(rho * sqrt(2)) = erf(rho) = 1/2.A069286
Decimal expansion of constant rho satisfying Gaussian Phi(rho * sqrt(2)) = erf(rho) = 1/2.
- Continued fraction for rho with erf(rho) = 1/2 = erfc(rho).A069287
Continued fraction for rho with erf(rho) = 1/2 = erfc(rho).
- Number of odd divisors of n <= sqrt(n).A069288
Number of odd divisors of n <= sqrt(n).
- Sum of odd divisors of n <= sqrt(n).A069289
Sum of odd divisors of n <= sqrt(n).
- Sum of the square roots of the square divisors of n.A069290
Sum of the square roots of the square divisors of n.
- Number of square divisors of n <= sqrt(n).A069291
Number of square divisors of n <= sqrt(n).
- Sum of square roots of square divisors of n <= sqrt(n).A069292
Sum of square roots of square divisors of n <= sqrt(n).
- Sum of square divisors of n <= sqrt(n).A069293
Sum of square divisors of n <= sqrt(n).
- Number of n X 3 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069294
Number of n X 3 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- Number of n X 4 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069295
Number of n X 4 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- Number of n X 5 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069296
Number of n X 5 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- Number of n X 6 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069297
Number of n X 6 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- Number of n X 7 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069298
Number of n X 7 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- Number of n X 8 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069299
Number of n X 8 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- Number of n X 9 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069300
Number of n X 9 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- Number of n X 10 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069301
Number of n X 10 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- Number of n X 11 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069302
Number of n X 11 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- Number of n X 12 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069303
Number of n X 12 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- Number of n X 13 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069304
Number of n X 13 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- Number of n X 14 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069305
Number of n X 14 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- Number of 2 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069306
Number of 2 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- Number of 3 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069307
Number of 3 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- Number of 4 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069308
Number of 4 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- Number of 5 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069309
Number of 5 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- Number of 6 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069310
Number of 6 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.