Sequences
392,541 sequences
- Decimal expansion of e^5.A092511
Decimal expansion of e^5.
- Decimal expansion of e^6.A092512
Decimal expansion of e^6.
- Decimal expansion of e^7.A092513
Decimal expansion of e^7.
- Decimal expansion of e^(1/5).A092514
Decimal expansion of e^(1/5).
- Decimal expansion of e^(1/6).A092515
Decimal expansion of e^(1/6).
- Decimal expansion of e^(1/7).A092516
Decimal expansion of e^(1/7).
- Product of tau values for consecutive integers.A092517
Product of tau values for consecutive integers.
- Primes p with no zero digits such that (the digit product of p) plus p is also prime.A092518
Primes p with no zero digits such that (the digit product of p) plus p is also prime.
- Smallest prime a(n) such that a(n)+6n, a(n)+12n and a(n)+18n are also primes.A092519
Smallest prime a(n) such that a(n)+6n, a(n)+12n and a(n)+18n are also primes.
- Number of square divisors of n-th cube: a(n) = A046951(n^3).A092520
Number of square divisors of n-th cube: a(n) = A046951(n^3).
- a(n) = 8*a(n-1) - 8*a(n-2) + a(n-3), with a(1) = 1, a(2) = 8, a(3) = 56.A092521
a(n) = 8*a(n-1) - 8*a(n-2) + a(n-3), with a(1) = 1, a(2) = 8, a(3) = 56.
- a(n) = p modulo prime(n+1), where p is the least prime greater than 4 and not congruent to any previous a(k) modulo prime(k+1).A092522
a(n) = p modulo prime(n+1), where p is the least prime greater than 4 and not congruent to any previous a(k) modulo prime(k+1).
- Number of distinct prime factors of n-th odd number.A092523
Number of distinct prime factors of n-th odd number.
- Binary representation of n interpreted in base p, where p is the smallest prime factor of n: p = A020639(n).A092524
Binary representation of n interpreted in base p, where p is the smallest prime factor of n: p = A020639(n).
- To binary representation of n, append as many ones as there are trailing zeros.A092525
To binary representation of n, append as many ones as there are trailing zeros.
- Decimal expansion of (2/3)*cos( (1/3)*arccos(29/2) ) + 1/3, the real root of x^3 - x^2 - 1.A092526
Decimal expansion of (2/3)*cos( (1/3)*arccos(29/2) ) + 1/3, the real root of x^3 - x^2 - 1.
- If M(n) is the n-th Mersenne prime, then a(n) is the smallest positive integer such that 2*a(n)*M(n)*M(n+1)-1 is prime.A092527
If M(n) is the n-th Mersenne prime, then a(n) is the smallest positive integer such that 2*a(n)*M(n)*M(n+1)-1 is prime.
- a(1) = 1; a(n) = smallest number such that the juxtaposition a(1)a(2)...a(n) is a prime.A092528
a(1) = 1; a(n) = smallest number such that the juxtaposition a(1)a(2)...a(n) is a prime.
- Primes p such that both the digit sum of p plus p and the digit product of p plus p are also primes.A092529
Primes p such that both the digit sum of p plus p and the digit product of p plus p are also primes.
- a(0) = 0; for n > 0, a(n) = T(n) + k where T(n) is the n-th triangular number (A000217) and k (see A026741) is the smallest positive number such that a(n) is divisible by n.A092530
a(0) = 0; for n > 0, a(n) = T(n) + k where T(n) is the n-th triangular number (A000217) and k (see A026741) is the smallest positive number such that a(n) is divisible by n.
- Expansion of (1+x^10)/((1-x)*(1-x^4)^2*(1-x^8)).A092531
Expansion of (1+x^10)/((1-x)*(1-x^4)^2*(1-x^8)).
- G.f.: 1/((1-x)*(1-x^4)*(1-x^8)).A092532
G.f.: 1/((1-x)*(1-x^4)*(1-x^8)).
- G.f.: (1+x^8)/((1-x)*(1-x^4)).A092533
G.f.: (1+x^8)/((1-x)*(1-x^4)).
- Expansion of (1-x+x^2)*(1+x^4)/((1-x)^2*(1-x^2)).A092534
Expansion of (1-x+x^2)*(1+x^4)/((1-x)^2*(1-x^2)).
- Expansion of g.f. (1+x^2)*(1+x^3)/((1-x)*(1-x^2)).A092535
Expansion of g.f. (1+x^2)*(1+x^3)/((1-x)*(1-x^2)).
- Sorted numbers of edges in the Archimedean polyhedra.A092536
Sorted numbers of edges in the Archimedean polyhedra.
- Sorted numbers of faces in the Archimedean polyhedra.A092537
Sorted numbers of faces in the Archimedean polyhedra.
- Sorted numbers of vertices in the Archimedean polyhedra.A092538
Sorted numbers of vertices in the Archimedean polyhedra.
- Binary representation of a(n) equals first n+1 terms of A051023.A092539
Binary representation of a(n) equals first n+1 terms of A051023.
- Primes such that their binary representation coincides with first n terms of A051023 for some n.A092540
Primes such that their binary representation coincides with first n terms of A051023 for some n.
- Minimal values of m=a^2+b^2=c^2+d^2 for each x=a+b+c+d (a,b,c,d positive integers).A092541
Minimal values of m=a^2+b^2=c^2+d^2 for each x=a+b+c+d (a,b,c,d positive integers).
- Table whose n-th row is constant and equal to n, read by antidiagonals alternately upwards and downwards.A092542
Table whose n-th row is constant and equal to n, read by antidiagonals alternately upwards and downwards.
- Table below read by antidiagonals alternately upwards and downwards.A092543
Table below read by antidiagonals alternately upwards and downwards.
- Molien series for complete weight enumerators of self-dual codes over Z/8Z.A092544
Molien series for complete weight enumerators of self-dual codes over Z/8Z.
- Molien series for complete weight enumerators of self-dual codes over Z/8Z containing the all-ones vector.A092545
Molien series for complete weight enumerators of self-dual codes over Z/8Z containing the all-ones vector.
- Molien series for complete weight enumerators of Type II self-dual codes over Z/8Z.A092546
Molien series for complete weight enumerators of Type II self-dual codes over Z/8Z.
- Molien series for complete weight enumerators of Type II self-dual codes over Z/8Z containing the all-ones vector.A092547
Molien series for complete weight enumerators of Type II self-dual codes over Z/8Z containing the all-ones vector.
- Molien series for complete weight enumerators of self-dual codes over GF(4) + GF(4)u with u^2 = 0.A092548
Molien series for complete weight enumerators of self-dual codes over GF(4) + GF(4)u with u^2 = 0.
- Molien series for symmetrized weight enumerators of self-dual codes over GF(4) + GF(4)u with u^2 = 0.A092549
Molien series for symmetrized weight enumerators of self-dual codes over GF(4) + GF(4)u with u^2 = 0.
- Expansion of -x*(1+x+x^2+x^4)/(-1+2*x^3+x^6).A092550
Expansion of -x*(1+x+x^2+x^4)/(-1+2*x^3+x^6).
- Duplicate of A033560.A092551
Duplicate of A033560.
- Let X_{m,n}(q) be the chromatic polynomial of the complete bipartite graph K_{m,n}. Then a(n) is the negative of the coefficient of the linear term of X_{n,n}(q).A092552
Let X_{m,n}(q) be the chromatic polynomial of the complete bipartite graph K_{m,n}. Then a(n) is the negative of the coefficient of the linear term of X_{n,n}(q).
- Decimal expansion of 1/e^2.A092553
Decimal expansion of 1/e^2.
- Decimal expansion of e^(-3).A092554
Decimal expansion of e^(-3).
- Decimal expansion of e^(-4).A092555
Decimal expansion of e^(-4).
- Triangle read by rows: T(1,1) = 1; for n>=2, write the first n^2 integers in an n X n array beginning with 1 in the upper left proceeding left to right and top to bottom; then T(n,k) is the first prime in the k-th row.A092556
Triangle read by rows: T(1,1) = 1; for n>=2, write the first n^2 integers in an n X n array beginning with 1 in the upper left proceeding left to right and top to bottom; then T(n,k) is the first prime in the k-th row.
- Triangle read by rows: T(1,1) = 1; for n>=2, write the first n^2 integers in an n X n array beginning with 1 in the upper left proceeding left to right and top to bottom; then T(n,k) is the last prime in the k-th row.A092557
Triangle read by rows: T(1,1) = 1; for n>=2, write the first n^2 integers in an n X n array beginning with 1 in the upper left proceeding left to right and top to bottom; then T(n,k) is the last prime in the k-th row.
- Numbers k such that 2^k +- 1 are both semiprimes.A092558
Numbers k such that 2^k +- 1 are both semiprimes.
- Numbers k such that 2^k + 1 is a semiprime.A092559
Numbers k such that 2^k + 1 is a semiprime.
- Decimal expansion of e^(-5).A092560
Decimal expansion of e^(-5).