Sequences
392,541 sequences
- Union of 3-smooth numbers and prime powers.A081061
Union of 3-smooth numbers and prime powers.
- Neither 3-smooth numbers nor prime powers.A081062
Neither 3-smooth numbers nor prime powers.
- Number of numbers <= n that are 3-smooth or prime powers.A081063
Number of numbers <= n that are 3-smooth or prime powers.
- Irregular array, read by rows: T(n,k) is the number of labeled acyclic digraphs with n nodes and k arcs (n >= 0, 0 <= k <= n*(n-1)/2).A081064
Irregular array, read by rows: T(n,k) is the number of labeled acyclic digraphs with n nodes and k arcs (n >= 0, 0 <= k <= n*(n-1)/2).
- Numbers n such that n^2 = (1/3)*(n+floor(sqrt(3)*n*floor(sqrt(3)*n))).A081065
Numbers n such that n^2 = (1/3)*(n+floor(sqrt(3)*n*floor(sqrt(3)*n))).
- Even order Taylor expansion coefficients at x=0 of exp(exp(x^2/2)-1), odd order coefficients being equal to zero.A081066
Even order Taylor expansion coefficients at x=0 of exp(exp(x^2/2)-1), odd order coefficients being equal to zero.
- a(n) = Lucas(4n+2)+2, or 5*Fibonacci(2n+1)^2.A081067
a(n) = Lucas(4n+2)+2, or 5*Fibonacci(2n+1)^2.
- a(n) = (Lucas(4*n+2) + 2)/5, or Fibonacci(2*n+1)^2, or A081067(n)/5.A081068
a(n) = (Lucas(4*n+2) + 2)/5, or Fibonacci(2*n+1)^2, or A081067(n)/5.
- a(n) = Lucas(4n)+2 = Lucas(2n)^2.A081069
a(n) = Lucas(4n)+2 = Lucas(2n)^2.
- Lucas(4n)-2, or 5*Fibonacci(2n)^2.A081070
Lucas(4n)-2, or 5*Fibonacci(2n)^2.
- a(n) = Lucas(4*n+2)-2 = Lucas(2*n+1)^2.A081071
a(n) = Lucas(4*n+2)-2 = Lucas(2*n+1)^2.
- a(n) = Fibonacci(4*n) + 3, or Fibonacci(2*n+2)*Lucas(2*n-2).A081072
a(n) = Fibonacci(4*n) + 3, or Fibonacci(2*n+2)*Lucas(2*n-2).
- Fibonacci(4n+2)+3, or Fibonacci(2n-1)*Lucas(2n+3).A081073
Fibonacci(4n+2)+3, or Fibonacci(2n-1)*Lucas(2n+3).
- a(n) = Fibonacci(4n)-3, or Fibonacci(2n-2)*Lucas(2n+2).A081074
a(n) = Fibonacci(4n)-3, or Fibonacci(2n-2)*Lucas(2n+2).
- a(n) = Fibonacci(4n+2) - 3.A081075
a(n) = Fibonacci(4n+2) - 3.
- a(n) = Lucas(4n) + 3, or 5*Fibonacci(2n-1)*Fibonacci(2n+1).A081076
a(n) = Lucas(4n) + 3, or 5*Fibonacci(2n-1)*Fibonacci(2n+1).
- a(n) = Lucas(4*n+2) + 3, or Lucas(2*n)*Lucas(2*n+2).A081077
a(n) = Lucas(4*n+2) + 3, or Lucas(2*n)*Lucas(2*n+2).
- a(n) = Lucas(4n) - 3, or Lucas(2n-1)*Lucas(2n+1).A081078
a(n) = Lucas(4n) - 3, or Lucas(2n-1)*Lucas(2n+1).
- a(n) = Lucas(4*n+2) - 3 = 5*Fibonacci(2*n)*Fibonacci(2*n+2).A081079
a(n) = Lucas(4*n+2) - 3 = 5*Fibonacci(2*n)*Fibonacci(2*n+2).
- Number of n X n ortho-projection matrices over GF(2). Also, the number of labeled ortho-projection graphs on n vertices.A081080
Number of n X n ortho-projection matrices over GF(2). Also, the number of labeled ortho-projection graphs on n vertices.
- Number of labeled, connected ortho-projection graphs on n vertices.A081081
Number of labeled, connected ortho-projection graphs on n vertices.
- Number of unlabeled, connected ortho-projection graphs on n vertices.A081082
Number of unlabeled, connected ortho-projection graphs on n vertices.
- Numbers n such that rad(n+1)=rad(n)+1, where rad(m)=A007947(m) is the squarefree kernel of m.A081083
Numbers n such that rad(n+1)=rad(n)+1, where rad(m)=A007947(m) is the squarefree kernel of m.
- Nonsquarefree numbers m such that rad(m+1)=rad(m)+1, where rad(m)=A007947(m) is the squarefree kernel of m.A081084
Nonsquarefree numbers m such that rad(m+1)=rad(m)+1, where rad(m)=A007947(m) is the squarefree kernel of m.
- Expansion of 1 / AGM(1, 1 - 8*x) in powers of x.A081085
Expansion of 1 / AGM(1, 1 - 8*x) in powers of x.
- Smallest partial quotients of an infinite simple continued fraction such that the fractional remainders sum to unity.A081086
Smallest partial quotients of an infinite simple continued fraction such that the fractional remainders sum to unity.
- Decimal expansion of the number whose simple continued fraction (A081086) has the smallest partial quotients such that the fractional remainders sum to unity.A081087
Decimal expansion of the number whose simple continued fraction (A081086) has the smallest partial quotients such that the fractional remainders sum to unity.
- Smallest partial quotients of a series of continued fractions that have a sum of unity, where the n-th continued fraction term is [0; a(n),a(n-1),...,a(1)], so that sum(n>0, [0; a(n),a(n-1),...,a(1)] ) = 1, with a(1)=2.A081088
Smallest partial quotients of a series of continued fractions that have a sum of unity, where the n-th continued fraction term is [0; a(n),a(n-1),...,a(1)], so that sum(n>0, [0; a(n),a(n-1),...,a(1)] ) = 1, with a(1)=2.
- Ratios of the terms of A081088: a(n) = A081088(n+1)/A081088(n); involves the partial quotients of a series of continued fractions that sum to unity.A081089
Ratios of the terms of A081088: a(n) = A081088(n+1)/A081088(n); involves the partial quotients of a series of continued fractions that sum to unity.
- a(n)^2 + 1 = A081089(n), where A081089(n) = A081088(n+1)/A081088(n); involves the partial quotients of a series of continued fractions that sum to unity.A081090
a(n)^2 + 1 = A081089(n), where A081089(n) = A081088(n+1)/A081088(n); involves the partial quotients of a series of continued fractions that sum to unity.
- Primes of the form 2^i + 2^j + 1, i > j > 0.A081091
Primes of the form 2^i + 2^j + 1, i > j > 0.
- Primes having a prime number of 1's in their binary representation.A081092
Primes having a prime number of 1's in their binary representation.
- a(n) is the smallest prime such that the number of 1's in its binary expansion is equal to the n-th prime.A081093
a(n) is the smallest prime such that the number of 1's in its binary expansion is equal to the n-th prime.
- 4th differences of partition numbers A000041.A081094
4th differences of partition numbers A000041.
- 5th differences of partition numbers A000041.A081095
5th differences of partition numbers A000041.
- Taylor coefficients at x=0 of exp(exp(x^3/3+x^2/2)-1).A081096
Taylor coefficients at x=0 of exp(exp(x^3/3+x^2/2)-1).
- Numbers n such that n^2= (1/5)*(n+floor(sqrt(5)*n*floor(sqrt(5)*n))).A081097
Numbers n such that n^2= (1/5)*(n+floor(sqrt(5)*n*floor(sqrt(5)*n))).
- Atomic numbers of the chemical elements sorted with respect to melting point.A081098
Atomic numbers of the chemical elements sorted with respect to melting point.
- Atomic numbers of the chemical elements sorted with respect to boiling point.A081099
Atomic numbers of the chemical elements sorted with respect to boiling point.
- Atomic numbers of chemical elements sorted by atomic radius.A081100
Atomic numbers of chemical elements sorted by atomic radius.
- Atomic numbers of the chemical elements sorted with respect to single-bond covalent radius.A081101
Atomic numbers of the chemical elements sorted with respect to single-bond covalent radius.
- Numbers k such that the first k digits of log_10(2) after the decimal point are primes.A081102
Numbers k such that the first k digits of log_10(2) after the decimal point are primes.
- Alternating sum of first three Stirling numbers of the first kind.A081103
Alternating sum of first three Stirling numbers of the first kind.
- Duplicate of A079028.A081104
Duplicate of A079028.
- 5th binomial transform of (1,1,0,0,0,0,.....).A081105
5th binomial transform of (1,1,0,0,0,0,.....).
- 6th binomial transform of (1,1,0,0,0,0,...).A081106
6th binomial transform of (1,1,0,0,0,0,...).
- 7th binomial transform of (1,1,0,0,0,0,...).A081107
7th binomial transform of (1,1,0,0,0,0,...).
- 8th binomial transform of (1,1,0,0,0,0,...).A081108
8th binomial transform of (1,1,0,0,0,0,...).
- 9th binomial transform of (1,1,0,0,0,0,0,...).A081109
9th binomial transform of (1,1,0,0,0,0,0,...).
- Divisors of 2^60 - 1.A081110
Divisors of 2^60 - 1.