Sequences
392,541 sequences
- Decimal expansion of constant appearing in the variance for searching in a digital tree.A086311
Decimal expansion of constant appearing in the variance for searching in a digital tree.
- Decimal expansion of constant appearing in the variance for inserting in a digital tree.A086312
Decimal expansion of constant appearing in the variance for inserting in a digital tree.
- Decimal expansion of constant c appearing in the expected number of pair of twin vacancies in a digital tree.A086313
Decimal expansion of constant c appearing in the expected number of pair of twin vacancies in a digital tree.
- Total number of edges in the distinct simple graphs on n nodes.A086314
Total number of edges in the distinct simple graphs on n nodes.
- Decimal expansion of constant theta appearing in the expected number of pair of twin vacancies in a digital tree.A086315
Decimal expansion of constant theta appearing in the expected number of pair of twin vacancies in a digital tree.
- Decimal expansion of estimate of the strongly triple-free set constant.A086316
Decimal expansion of estimate of the strongly triple-free set constant.
- Decimal expansion of asymptotic constant xi for counts of weakly binary trees.A086317
Decimal expansion of asymptotic constant xi for counts of weakly binary trees.
- Decimal expansion of asymptotic constant eta for counts of weakly binary trees.A086318
Decimal expansion of asymptotic constant eta for counts of weakly binary trees.
- Primes produced by repeated application of the formula p -> (4p +- 3) starting at the prime 2.A086319
Primes produced by repeated application of the formula p -> (4p +- 3) starting at the prime 2.
- a(n) is the depth of the prime tree formed when 4p +- 3 is applied to the n-th prime and repeatedly to any primes generated from the n-th prime via this process.A086320
a(n) is the depth of the prime tree formed when 4p +- 3 is applied to the n-th prime and repeatedly to any primes generated from the n-th prime via this process.
- Primes produced by repeated application of the formula p -> (6p +- 5) starting at the prime 2.A086321
Primes produced by repeated application of the formula p -> (6p +- 5) starting at the prime 2.
- Primes produced by repeated application of the formula p -> (10p +- 3) starting at the prime 2.A086322
Primes produced by repeated application of the formula p -> (10p +- 3) starting at the prime 2.
- Number of n X n circulant invertible (0,1) matrices over the reals.A086323
Number of n X n circulant invertible (0,1) matrices over the reals.
- Number of n X n circulant singular matrices over GF(2).A086324
Number of n X n circulant singular matrices over GF(2).
- Let u(1)=0, u(2)=1, u(k)=u(k-1)+u(k-2)/(k-2); then a(n)=n!*u(n).A086325
Let u(1)=0, u(2)=1, u(k)=u(k-1)+u(k-2)/(k-2); then a(n)=n!*u(n).
- Markoff numbers (A002559) multiplied by 3.A086326
Markoff numbers (A002559) multiplied by 3.
- Number of factors over Q in the factorization of the Chebyshev polynomial of the second kind U_n(x).A086327
Number of factors over Q in the factorization of the Chebyshev polynomial of the second kind U_n(x).
- Number of n X n circulant singular (0,1) matrices over the reals.A086328
Number of n X n circulant singular (0,1) matrices over the reals.
- Triangle T(n,k) read by rows, given by [0, 1, 0, 1, 0, 1, 0, 1, 0, 1, ...] DELTA [1, 0, 2, 0, 3, 0, 4, 0, 5, 0, 6, 0, 7, ...] where DELTA is the operator defined in A084938.A086329
Triangle T(n,k) read by rows, given by [0, 1, 0, 1, 0, 1, 0, 1, 0, 1, ...] DELTA [1, 0, 2, 0, 3, 0, 4, 0, 5, 0, 6, 0, 7, ...] where DELTA is the operator defined in A084938.
- a(n) = Sum_{m >= 2} m! mod n.A086330
a(n) = Sum_{m >= 2} m! mod n.
- Expansion of e.g.f. exp(x)/(1 + LambertW(-x)).A086331
Expansion of e.g.f. exp(x)/(1 + LambertW(-x)).
- Least highly composite number having n distinct prime factors.A086332
Least highly composite number having n distinct prime factors.
- Index power of 2 in the first highly composite number m such that omega(m)=n.A086333
Index power of 2 in the first highly composite number m such that omega(m)=n.
- Number of highly composite numbers having n distinct prime factors.A086334
Number of highly composite numbers having n distinct prime factors.
- a(n) = a((n - a(n-1))*(1-mod(n, 2))+a(n-1)*(mod(n, 2))) + a((n - a(n-2))*(1-mod(n, 2)) +(n-a(n-1))*(mod(n, 2))) with a(1) = a(2) = 1.A086335
a(n) = a((n - a(n-1))*(1-mod(n, 2))+a(n-1)*(mod(n, 2))) + a((n - a(n-2))*(1-mod(n, 2)) +(n-a(n-1))*(mod(n, 2))) with a(1) = a(2) = 1.
- Records in A087666.A086336
Records in A087666.
- Numbers n such that n, n-1 and n-2 have the same prime signature.A086337
Numbers n such that n, n-1 and n-2 have the same prime signature.
- Numbers n such that the trinomial x^n + x + 1 is irreducible over GF(11).A086338
Numbers n such that the trinomial x^n + x + 1 is irreducible over GF(11).
- Irreducible trinomials of prime degree for some k: x^p + x^k + 1 is irreducible over GF(5) for at least one k, p>k>0.A086339
Irreducible trinomials of prime degree for some k: x^p + x^k + 1 is irreducible over GF(5) for at least one k, p>k>0.
- Numbers n such that 1 + (n-1)*n*(n+1) is a square.A086340
Numbers n such that 1 + (n-1)*n*(n+1) is a square.
- a(n) = 2*2^floor(n/2) - (-1)^n.A086341
a(n) = 2*2^floor(n/2) - (-1)^n.
- Smallest number of 1's in binary expansion of any positive multiple of n.A086342
Smallest number of 1's in binary expansion of any positive multiple of n.
- a(n) starts new run of consecutive values in A055938.A086343
a(n) starts new run of consecutive values in A055938.
- a(n) = -2*a(n-1) + 4*a(n-2), a(0) = 1, a(1) = 0.A086344
a(n) = -2*a(n-1) + 4*a(n-2), a(0) = 1, a(1) = 0.
- Number of connected oriented graphs (i.e., connected directed graphs with no bidirected edges) on n nodes.A086345
Number of connected oriented graphs (i.e., connected directed graphs with no bidirected edges) on n nodes.
- On a 3 X 3 board, the number of n-move paths for a chess king ending in a given corner square.A086346
On a 3 X 3 board, the number of n-move paths for a chess king ending in a given corner square.
- On a 3 X 3 board, number of n-move routes of chess king ending in a given side square.A086347
On a 3 X 3 board, number of n-move routes of chess king ending in a given side square.
- On a 3 X 3 board, number of n-move routes of chess king ending in the central square.A086348
On a 3 X 3 board, number of n-move routes of chess king ending in the central square.
- On a 3 X 3 board, the number of n-move paths for a chess king.A086349
On a 3 X 3 board, the number of n-move paths for a chess king.
- Square array of Pell related numbers, read by antidiagonals.A086350
Square array of Pell related numbers, read by antidiagonals.
- T(n,3) of A086350.A086351
T(n,3) of A086350.
- Main diagonal of square array A086350.A086352
Main diagonal of square array A086350.
- Fixed point if nonzero-digit product of n! is iterated.A086353
Fixed point if nonzero-digit product of n! is iterated.
- Fixed point if (nonzero-digit product)-function at initial value 2^n is iterated.A086354
Fixed point if (nonzero-digit product)-function at initial value 2^n is iterated.
- Fixed point if [nonzero-digit product]-function at initial-value=prime(n) is iterated.A086355
Fixed point if [nonzero-digit product]-function at initial-value=prime(n) is iterated.
- Fixed point if [nonzero-digit product]-function at initial-value=C[2n,n]=central binomial coefficient is iterated.A086356
Fixed point if [nonzero-digit product]-function at initial-value=C[2n,n]=central binomial coefficient is iterated.
- Fixed point if [nonzero-digit-product]-function at initial-value=A002110(n)=n-th primorial is iterated.A086357
Fixed point if [nonzero-digit-product]-function at initial-value=A002110(n)=n-th primorial is iterated.
- Digital root of n!.A086358
Digital root of n!.
- Fixed point if [decimal-digit-sum]-function at initial-value=A000984(n)=C[2n,n] is iterated.A086359
Fixed point if [decimal-digit-sum]-function at initial-value=A000984(n)=C[2n,n] is iterated.
- The n-th primorial number reduced modulo 9.A086360
The n-th primorial number reduced modulo 9.