Sequences
392,541 sequences
- Number of elements of GF(5^n) with trace 1 and subtrace 2.A074011
Number of elements of GF(5^n) with trace 1 and subtrace 2.
- Number of elements of GF(5^n) with trace 1 and subtrace 3.A074012
Number of elements of GF(5^n) with trace 1 and subtrace 3.
- Number of elements of GF(5^n) with trace 1 and subtrace 4.A074013
Number of elements of GF(5^n) with trace 1 and subtrace 4.
- Number of elements of GF(7^n) with trace 0 and subtrace 0.A074014
Number of elements of GF(7^n) with trace 0 and subtrace 0.
- Number of elements of GF(7^n) with trace 0 and subtrace 1.A074015
Number of elements of GF(7^n) with trace 0 and subtrace 1.
- Number of elements of GF(7^n) with trace 0 and subtrace 3.A074016
Number of elements of GF(7^n) with trace 0 and subtrace 3.
- Number of elements of GF(7^n) with trace 1 and subtrace 0.A074017
Number of elements of GF(7^n) with trace 1 and subtrace 0.
- Number of elements of GF(7^n) with trace 1 and subtrace 1.A074018
Number of elements of GF(7^n) with trace 1 and subtrace 1.
- Number of elements of GF(7^n) with trace 1 and subtrace 2.A074019
Number of elements of GF(7^n) with trace 1 and subtrace 2.
- Number of elements of GF(7^n) with trace 1 and subtrace 3.A074020
Number of elements of GF(7^n) with trace 1 and subtrace 3.
- Number of elements of GF(7^n) with trace 1 and subtrace 4.A074021
Number of elements of GF(7^n) with trace 1 and subtrace 4.
- Number of elements of GF(7^n) with trace 1 and subtrace 5.A074022
Number of elements of GF(7^n) with trace 1 and subtrace 5.
- Number of elements of GF(7^n) with trace 1 and subtrace 6.A074023
Number of elements of GF(7^n) with trace 1 and subtrace 6.
- Duplicate of A054661.A074024
Duplicate of A054661.
- Numbers k such that a triplewhist tournament TWh(k) exists.A074025
Numbers k such that a triplewhist tournament TWh(k) exists.
- Duplicate of A054663.A074026
Duplicate of A054663.
- Number of binary Lyndon words of length n with trace 0 and subtrace 0 over Z_2.A074027
Number of binary Lyndon words of length n with trace 0 and subtrace 0 over Z_2.
- Number of binary Lyndon words of length n with trace 0 and subtrace 1 over Z_2.A074028
Number of binary Lyndon words of length n with trace 0 and subtrace 1 over Z_2.
- Number of binary Lyndon words of length n with trace 1 and subtrace 0 over Z_2.A074029
Number of binary Lyndon words of length n with trace 1 and subtrace 0 over Z_2.
- Number of binary Lyndon words of length n with trace 1 and subtrace 1 over Z_2.A074030
Number of binary Lyndon words of length n with trace 1 and subtrace 1 over Z_2.
- Number of degree-n irreducible polynomials over GF(4) with trace 0 and subtrace 0.A074031
Number of degree-n irreducible polynomials over GF(4) with trace 0 and subtrace 0.
- Number of degree-n irreducible polynomials over GF(4) with trace 0 and subtrace 1.A074032
Number of degree-n irreducible polynomials over GF(4) with trace 0 and subtrace 1.
- Number of degree-n irreducible polynomials over GF(4) with trace 1 and subtrace 0.A074033
Number of degree-n irreducible polynomials over GF(4) with trace 1 and subtrace 0.
- Number of degree-n irreducible polynomials over GF(4) with trace 1 and subtrace 1.A074034
Number of degree-n irreducible polynomials over GF(4) with trace 1 and subtrace 1.
- Let a = RootOf( x^2+x+1 ) and b = 1+a. Number of degree-n irreducible polynomials over GF(4) with trace 1 and subtrace a.A074035
Let a = RootOf( x^2+x+1 ) and b = 1+a. Number of degree-n irreducible polynomials over GF(4) with trace 1 and subtrace a.
- Sum of the primes from the smallest prime factor of n to the largest prime factor of n.A074036
Sum of the primes from the smallest prime factor of n to the largest prime factor of n.
- Sum of the composites between the smallest prime factor of n and the largest prime factor of n.A074037
Sum of the composites between the smallest prime factor of n and the largest prime factor of n.
- If n is the k-th single (i.e., non-twin) prime then a(n) = k, otherwise a(n) = 0.A074038
If n is the k-th single (i.e., non-twin) prime then a(n) = k, otherwise a(n) = 0.
- If (n, n+2) is the k-th twin prime pair then k else 0.A074039
If (n, n+2) is the k-th twin prime pair then k else 0.
- Product of first n twin prime pair products.A074040
Product of first n twin prime pair products.
- Product of first n single (i.e., non-twin) primes.A074041
Product of first n single (i.e., non-twin) primes.
- Numerator of Sum_{k=1..n} 1/A077800(k), denominator=A074043.A074042
Numerator of Sum_{k=1..n} 1/A077800(k), denominator=A074043.
- Denominator of Sum_{k=1..n} 1/A077800(k), numerator=A074042.A074043
Denominator of Sum_{k=1..n} 1/A077800(k), numerator=A074042.
- Largest divisor of n having no prime gaps.A074044
Largest divisor of n having no prime gaps.
- Number of rooted trees of 2n+1 nodes with every leaf at height n.A074045
Number of rooted trees of 2n+1 nodes with every leaf at height n.
- a(n)=a(n-1)*a(n-2)*a(n-3)*(1/a(n-1)+1/a(n-2)+1/a(n-3)) starting with a(1)=a(2)=1 and a(3)=2.A074046
a(n)=a(n-1)*a(n-2)*a(n-3)*(1/a(n-1)+1/a(n-2)+1/a(n-3)) starting with a(1)=a(2)=1 and a(3)=2.
- a(n)=a(n-1)*a(n-2)*a(n-3)*(1/a(n-1)+1/a(n-2)+1/a(n-3)) starting with a(1)=a(2)=a(3)=1.A074047
a(n)=a(n-1)*a(n-2)*a(n-3)*(1/a(n-1)+1/a(n-2)+1/a(n-3)) starting with a(1)=a(2)=a(3)=1.
- Pentanacci numbers with initial conditions a(0)=5, a(1)=1, a(2)=3, a(3)=7, a(4)=15.A074048
Pentanacci numbers with initial conditions a(0)=5, a(1)=1, a(2)=3, a(3)=7, a(4)=15.
- Tree generated by the Wythoff sequences: a permutation of the positive integers.A074049
Tree generated by the Wythoff sequences: a permutation of the positive integers.
- Inverse permutation to A074049.A074050
Inverse permutation to A074049.
- For each n there are uniquely determined numbers a(n) and b(n) and a polynomial p_n(x) such that for all integers m we have Sum_{i=1..m}i^n(i+1)! = a(n)*Sum_{i=1..m} (i+1)! + p_n(m)*(m+2)! + b(n). The sequence b(n) is A074052.A074051
For each n there are uniquely determined numbers a(n) and b(n) and a polynomial p_n(x) such that for all integers m we have Sum_{i=1..m}i^n(i+1)! = a(n)*Sum_{i=1..m} (i+1)! + p_n(m)*(m+2)! + b(n). The sequence b(n) is A074052.
- The lowest order term in an expansion of Sum_{i=1..m} i^n*(i+1)! in a special factorial basis.A074052
The lowest order term in an expansion of Sum_{i=1..m} i^n*(i+1)! in a special factorial basis.
- Numbers n such that A001414(n) = sum of composites from the smallest prime factor of n to the largest prime factor of n.A074053
Numbers n such that A001414(n) = sum of composites from the smallest prime factor of n to the largest prime factor of n.
- Numbers n such that sum of composites from smallest prime factor of n to largest prime factor of n is prime.A074054
Numbers n such that sum of composites from smallest prime factor of n to largest prime factor of n is prime.
- Numbers k such that A074037(k) = A002034(k).A074055
Numbers k such that A074037(k) = A002034(k).
- a(n)=a(n-1)^3/a(n-2)^2+a(n-1)*a(n-2) with a(1)=a(2)=1.A074056
a(n)=a(n-1)^3/a(n-2)^2+a(n-1)*a(n-2) with a(1)=a(2)=1.
- a(n) = 2*phi(n-2)-(n-1).A074057
a(n) = 2*phi(n-2)-(n-1).
- Reflected tetranacci numbers A073817.A074058
Reflected tetranacci numbers A073817.
- Dimension of the cohomology ring of the moduli space of n-pointed curves of genus 0 satisfying the associativity equations of physics (also known as the WDVV equations).A074059
Dimension of the cohomology ring of the moduli space of n-pointed curves of genus 0 satisfying the associativity equations of physics (also known as the WDVV equations).
- Graded dimension of the cohomology ring of the moduli space of n-pointed stable curves of genus 0 satisfying the associativity equations of physics (also known as the WDVV equations).A074060
Graded dimension of the cohomology ring of the moduli space of n-pointed stable curves of genus 0 satisfying the associativity equations of physics (also known as the WDVV equations).