Sequences
392,541 sequences
- a(0)=0, a(1)=1, a(n) = n*2^(n-2) for n >= 2.A057711
a(0)=0, a(1)=1, a(n) = n*2^(n-2) for n >= 2.
- Number of "polyhes" of order n: a polyhe of order n is obtained by taking a polyhex made of n hexagons (A000228); cutting each of the n hexagons along a diameter and throwing away half that hexagon, in such a way that the remaining figure (made of n half-hexagons) is connected.A057712
Number of "polyhes" of order n: a polyhe of order n is obtained by taking a polyhex made of n hexagons (A000228); cutting each of the n hexagons along a diameter and throwing away half that hexagon, in such a way that the remaining figure (made of n half-hexagons) is connected.
- Smallest prime divisor of Kummer numbers ( = primorials - 1), or 1 if no such prime exists.A057713
Smallest prime divisor of Kummer numbers ( = primorials - 1), or 1 if no such prime exists.
- Composite numbers m = Product p_i^{e_i} such that p_j^{e_j} < p_k^{e_k} for all p_j < p_k.A057714
Composite numbers m = Product p_i^{e_i} such that p_j^{e_j} < p_k^{e_k} for all p_j < p_k.
- Numbers m = Product p_i^{e_i}, not a power of a prime, such that p_j^{e_j} > p_k^{e_k} for all p_j < p_k.A057715
Numbers m = Product p_i^{e_i}, not a power of a prime, such that p_j^{e_j} > p_k^{e_k} for all p_j < p_k.
- The nonpowers of 2.A057716
The nonpowers of 2.
- The non-powers of 10.A057717
The non-powers of 10.
- A036917/8 (omitting leading term of A036917).A057718
A036917/8 (omitting leading term of A036917).
- Prime factors of numbers in A006521 (numbers k that divide 2^k + 1).A057719
Prime factors of numbers in A006521 (numbers k that divide 2^k + 1).
- Decimal expansion of muon-to-electron mass ratio.A057720
Decimal expansion of muon-to-electron mass ratio.
- a(n) = n^4 + 3*n^2 + 1.A057721
a(n) = n^4 + 3*n^2 + 1.
- a(n) = n^4 - 3*n^2 + 1.A057722
a(n) = n^4 - 3*n^2 + 1.
- Sum of positive divisors of n that are divisible by every prime that divides n.A057723
Sum of positive divisors of n that are divisible by every prime that divides n.
- Number of "polyares" of order n (turning over allowed).A057724
Number of "polyares" of order n (turning over allowed).
- Number of "polyares" of order n (turning over not allowed).A057725
Number of "polyares" of order n (turning over not allowed).
- Primes of the form 3^(2^n) + 2.A057726
Primes of the form 3^(2^n) + 2.
- 3^(2^n) + 2.A057727
3^(2^n) + 2.
- A triangular table of decreasing powers of two (with first column all ones).A057728
A triangular table of decreasing powers of two (with first column all ones).
- Number of triangular polyominoes (or polyiamonds) [A000577] with perimeter n.A057729
Number of triangular polyominoes (or polyiamonds) [A000577] with perimeter n.
- Number of free polyominoes (A000105) with perimeter 2n.A057730
Number of free polyominoes (A000105) with perimeter 2n.
- Irregular triangle read by rows: T(n,k) = number of elements of order k in symmetric group S_n, for n >= 1, 1 <= k <= g(n), where g(n) = A000793(n) is Landau's function.A057731
Irregular triangle read by rows: T(n,k) = number of elements of order k in symmetric group S_n, for n >= 1, 1 <= k <= g(n), where g(n) = A000793(n) is Landau's function.
- Numbers k such that 2^k + 3 is prime.A057732
Numbers k such that 2^k + 3 is prime.
- Primes of the form 2^k + 3.A057733
Primes of the form 2^k + 3.
- Erroneous version of A000084.A057734
Erroneous version of A000084.
- Primes of the form 3^k + 2.A057735
Primes of the form 3^k + 2.
- Primes p such that 2^p + 3 is prime.A057736
Primes p such that 2^p + 3 is prime.
- Primes of the form 2^p + 3, where p is prime.A057737
Primes of the form 2^p + 3, where p is prime.
- Primes p such that 3^p + 2 is prime.A057738
Primes p such that 3^p + 2 is prime.
- Primes of the form 3^p + 2, where p is prime.A057739
Primes of the form 3^p + 2, where p is prime.
- Irregular triangle read by rows: T(n,k) is the number of elements of alternating group A_n having order k, for n >= 1, 1 <= k <= A051593(n).A057740
Irregular triangle read by rows: T(n,k) is the number of elements of alternating group A_n having order k, for n >= 1, 1 <= k <= A051593(n).
- Table T(n,k) giving number of elements of order k in dihedral group D_{2n} of order 2n, n >= 1, 1<=k<=g(n), where g(n) = 2 if n=1 else g(n) = n.A057741
Table T(n,k) giving number of elements of order k in dihedral group D_{2n} of order 2n, n >= 1, 1<=k<=g(n), where g(n) = 2 if n=1 else g(n) = n.
- Maximal order of element of alternating group A_{2n}.A057742
Maximal order of element of alternating group A_{2n}.
- Maximal order of element of alternating group A_{2n+1}.A057743
Maximal order of element of alternating group A_{2n+1}.
- Expansion of (1-2*x^3)/(1-2*x-x^3+2*x^4).A057744
Expansion of (1-2*x^3)/(1-2*x-x^3+2*x^4).
- Erroneous version of A083276.A057745
Erroneous version of A083276.
- Even numbers not the sum of a pair of twin even-lucky-numbers (from A045955, A045956).A057746
Even numbers not the sum of a pair of twin even-lucky-numbers (from A045955, A045956).
- Number of decompositions of 2n-1 into sum of a lucky number and an even-lucky-number (from A045954).A057747
Number of decompositions of 2n-1 into sum of a lucky number and an even-lucky-number (from A045954).
- Number of decompositions of 2n-1 into sum of a twin lucky number and a twin even-lucky-number (from A045955, A045956).A057748
Number of decompositions of 2n-1 into sum of a twin lucky number and a twin even-lucky-number (from A045955, A045956).
- Prime degrees of absolutely reducible trinomials: primes p such that x^p + x^k + 1 is reducible over GF(2) for all k, p>k>0.A057749
Prime degrees of absolutely reducible trinomials: primes p such that x^p + x^k + 1 is reducible over GF(2) for all k, p>k>0.
- Number of non-factorable subsets of size >= 2 of a 1 X n uniform grid.A057750
Number of non-factorable subsets of size >= 2 of a 1 X n uniform grid.
- Irreducible trinomials of prime degree for some k: x^p + x^k + 1 is irreducible over GF(2) for at least one k, p>k>0.A057751
Irreducible trinomials of prime degree for some k: x^p + x^k + 1 is irreducible over GF(2) for at least one k, p>k>0.
- Difference between nearest integer to Li(10^n) and pi(10^n), where Li(x) = integral of log(x) and pi(10^n) = number of primes <= 10^n (A006880).A057752
Difference between nearest integer to Li(10^n) and pi(10^n), where Li(x) = integral of log(x) and pi(10^n) = number of primes <= 10^n (A006880).
- Total area of all polyominoes with perimeter 2n.A057753
Total area of all polyominoes with perimeter 2n.
- Integer nearest to Li(10^n), where Li(x) = integral(0..x, dt/log(t)).A057754
Integer nearest to Li(10^n), where Li(x) = integral(0..x, dt/log(t)).
- Number of digits in n-th Fermat number (A000215).A057755
Number of digits in n-th Fermat number (A000215).
- Least nonnegative square root of -1 mod n for n in A008784.A057756
Least nonnegative square root of -1 mod n for n in A008784.
- Least nonnegative square root of 2 mod n for n in A057126.A057757
Least nonnegative square root of 2 mod n for n in A057126.
- Duplicate of A057125.A057758
Duplicate of A057125.
- Least nonnegative square root of 3 mod n for n in A057125.A057759
Least nonnegative square root of 3 mod n for n in A057125.
- Numbers n such that 2 is a cube mod n.A057760
Numbers n such that 2 is a cube mod n.