Sequences
392,541 sequences
- Molien series for group G_{1,3} of order 2304.A051461
Molien series for group G_{1,3} of order 2304.
- Molien series for group G_{1,2}^{8} of order 1536.A051462
Molien series for group G_{1,2}^{8} of order 1536.
- Molien series for group G_{1,3}^{8} of order 4608.A051463
Molien series for group G_{1,3}^{8} of order 4608.
- Number of divisors of 4*(2^n-1) + 1.A051464
Number of divisors of 4*(2^n-1) + 1.
- Order of group G_{1,n}.A051465
Order of group G_{1,n}.
- Largest product of primorials less than A025487(n) that divides A025487(n).A051466
Largest product of primorials less than A025487(n) that divides A025487(n).
- (Terms in A029640)/2.A051467
(Terms in A029640)/2.
- (Terms in A029641)/2.A051468
(Terms in A029641)/2.
- (Terms in A029643)/2.A051469
(Terms in A029643)/2.
- a(n) is least value of m for which the sum of Liouville's function from 1 to m is n.A051470
a(n) is least value of m for which the sum of Liouville's function from 1 to m is n.
- (Terms in A029647)/2.A051471
(Terms in A029647)/2.
- a(n) = A028317(n)/2.A051472
a(n) = A028317(n)/2.
- a(n) = A028321(n)/2.A051473
a(n) = A028321(n)/2.
- (Terms in A014450)/2.A051474
(Terms in A014450)/2.
- (Terms in A014472)/2.A051475
(Terms in A014472)/2.
- (Terms in A014733)/4.A051476
(Terms in A014733)/4.
- (Terms in A014759)/4.A051477
(Terms in A014759)/4.
- a(n) is the number of values k satisfying phi(k) = 4*n+2, n>0.A051478
a(n) is the number of values k satisfying phi(k) = 4*n+2, n>0.
- Values of i such that phi(x) = 4i+2 has 4 solutions.A051479
Values of i such that phi(x) = 4i+2 has 4 solutions.
- Run lengths in binary expansion of Pi.A051480
Run lengths in binary expansion of Pi.
- a(n+1) = a(n)^2 + n*(n+3)*a(n).A051481
a(n+1) = a(n)^2 + n*(n+3)*a(n).
- Run lengths in binary expansion of e.A051482
Run lengths in binary expansion of e.
- Order of group H_{1,n}.A051483
Order of group H_{1,n}.
- a(n) is the next natural number (besides 1) which is not congruent to a(i) mod a(j) for any i < j < n.A051484
a(n) is the next natural number (besides 1) which is not congruent to a(i) mod a(j) for any i < j < n.
- Number of double nodes (exactly two nodes on that level) for all Motzkin paths of length n.A051485
Number of double nodes (exactly two nodes on that level) for all Motzkin paths of length n.
- Triangle T(n,k) = number of symmetric Boolean functions of n variables and rank from 0 to 2^n.A051486
Triangle T(n,k) = number of symmetric Boolean functions of n variables and rank from 0 to 2^n.
- Numbers k such that phi(k) = phi(k - phi(k)).A051487
Numbers k such that phi(k) = phi(k - phi(k)).
- Numbers k such that phi(k) < phi(k - phi(k)).A051488
Numbers k such that phi(k) < phi(k - phi(k)).
- a(n) = n^(n+2) + (n+2)^n.A051489
a(n) = n^(n+2) + (n+2)^n.
- a(n) = n^(n+2)*(n+2)^n.A051490
a(n) = n^(n+2)*(n+2)^n.
- Decimal expansion of Otter's rooted tree constant: lim_{n->inf} A000081(n+1)/A000081(n).A051491
Decimal expansion of Otter's rooted tree constant: lim_{n->inf} A000081(n+1)/A000081(n).
- Continued fraction for Otter's rooted tree constant: lim_{n->inf} A000081(n+1)/A000081(n).A051492
Continued fraction for Otter's rooted tree constant: lim_{n->inf} A000081(n+1)/A000081(n).
- Triangles with perimeter n and relatively prime integer side lengths.A051493
Triangles with perimeter n and relatively prime integer side lengths.
- Expansion of (1 - x + x^2 + x^3)/(1 - x^2)^3.A051494
Expansion of (1 - x + x^2 + x^3)/(1 - x^2)^3.
- Expansion of (1 + x + 2*x^2 - x^3 + x^4)/(1 - 3*x^3 + 3*x^6 - x^9).A051495
Expansion of (1 + x + 2*x^2 - x^3 + x^4)/(1 - 3*x^3 + 3*x^6 - x^9).
- Decimal expansion of the probability that a point of an infinite (rooted) tree is fixed by every automorphism of the tree.A051496
Decimal expansion of the probability that a point of an infinite (rooted) tree is fixed by every automorphism of the tree.
- (Terms in A014476)/2.A051497
(Terms in A014476)/2.
- a(n) = floor(tan(n)^3).A051498
a(n) = floor(tan(n)^3).
- Nearest integer to tan(n)^3.A051499
Nearest integer to tan(n)^3.
- a(n) = (3^n + 1)^2/4.A051500
a(n) = (3^n + 1)^2/4.
- Bertrand primes III: a(n+1) is the smallest prime > 2^a(n).A051501
Bertrand primes III: a(n+1) is the smallest prime > 2^a(n).
- Number of asymmetric types of Boolean functions of n variables under action of complementing group C(n,2).A051502
Number of asymmetric types of Boolean functions of n variables under action of complementing group C(n,2).
- a(n) = min { n, floor(100/n) }.A051503
a(n) = min { n, floor(100/n) }.
- Number of asymmetric digraphs with n nodes.A051504
Number of asymmetric digraphs with n nodes.
- a(n) = min { 2^n, floor(100/sqrt(n)) }.A051505
a(n) = min { 2^n, floor(100/sqrt(n)) }.
- a(n) = min { n^n, floor(100/sqrt(n)) }.A051506
a(n) = min { n^n, floor(100/sqrt(n)) }.
- Primes p such that p*q+2 is prime, where q is next prime after p.A051507
Primes p such that p*q+2 is prime, where q is next prime after p.
- a(n) = floor(Sum_{k=0..n} tan(k)).A051508
a(n) = floor(Sum_{k=0..n} tan(k)).
- a(n) = round(Sum_{k=0..n} tan(k)).A051509
a(n) = round(Sum_{k=0..n} tan(k)).
- a(n) = ceiling(Sum_{k=0..n} tan(k)).A051510
a(n) = ceiling(Sum_{k=0..n} tan(k)).