Sequences
392,541 sequences
- Number of monic irreducible polynomials over GF(4) with zero trace.A054661
Number of monic irreducible polynomials over GF(4) with zero trace.
- Number of monic irreducible polynomials over GF(5) with fixed nonzero trace.A054662
Number of monic irreducible polynomials over GF(5) with fixed nonzero trace.
- Number of monic irreducible polynomials over GF(5) with zero trace.A054663
Number of monic irreducible polynomials over GF(5) with zero trace.
- Number of 4-ary Lyndon words of length n with trace 0 mod 4.A054664
Number of 4-ary Lyndon words of length n with trace 0 mod 4.
- Number of 6-ary Lyndon words with trace 0 mod 6.A054665
Number of 6-ary Lyndon words with trace 0 mod 6.
- Number of 6-ary Lyndon words with trace 1 mod 6.A054666
Number of 6-ary Lyndon words with trace 1 mod 6.
- Number of 6-ary Lyndon words with trace 2 mod 6.A054667
Number of 6-ary Lyndon words with trace 2 mod 6.
- Number of distinct non-extendable sequences X={x(1),x(2),...,x(k)} where x(1)=1, the x(i)'s are distinct elements of {1,...,n} with |x(i)-x(i+1)|=1 or 2, for i=1,2,...,k.A054668
Number of distinct non-extendable sequences X={x(1),x(2),...,x(k)} where x(1)=1, the x(i)'s are distinct elements of {1,...,n} with |x(i)-x(i+1)|=1 or 2, for i=1,2,...,k.
- Triangular array T(n,k) giving the number of labeled even graphs with n nodes and k edges for n >= 0 and 0 <= k <= n*(n-1-[0 == n mod 2])/2 (with no trailing zeros).A054669
Triangular array T(n,k) giving the number of labeled even graphs with n nodes and k edges for n >= 0 and 0 <= k <= n*(n-1-[0 == n mod 2])/2 (with no trailing zeros).
- Numerators of (reduced) coefficients of Laurent series for conformal mapping from exterior of unit disk onto exterior of Mandelbrot set.A054670
Numerators of (reduced) coefficients of Laurent series for conformal mapping from exterior of unit disk onto exterior of Mandelbrot set.
- Denominators of (reduced) coefficients of Laurent series for conformal mapping from exterior of unit disk onto exterior of Mandelbrot set.A054671
Denominators of (reduced) coefficients of Laurent series for conformal mapping from exterior of unit disk onto exterior of Mandelbrot set.
- Nearest integer to n^tan(n).A054672
Nearest integer to n^tan(n).
- Nearest integer to n^sin(n).A054673
Nearest integer to n^sin(n).
- Nearest integer to n^cos(n).A054674
Nearest integer to n^cos(n).
- Nearest integer to tan(n)^n.A054675
Nearest integer to tan(n)^n.
- Numerator of expected length of longest increasing subsequence of a permutation of length n.A054676
Numerator of expected length of longest increasing subsequence of a permutation of length n.
- Denominator of expected length of longest increasing subsequence of a permutation of length n.A054677
Denominator of expected length of longest increasing subsequence of a permutation of length n.
- n consecutive primes differ by a multiple of 4 starting at a(n).A054678
n consecutive primes differ by a multiple of 4 starting at a(n).
- First of n consecutive primes which differ by a multiple of 6.A054679
First of n consecutive primes which differ by a multiple of 6.
- n consecutive primes differ by a multiple of 8 starting at a(n).A054680
n consecutive primes differ by a multiple of 8 starting at a(n).
- Start of a run of consecutive primes of length n each ending with the same digit.A054681
Start of a run of consecutive primes of length n each ending with the same digit.
- a(n) = smallest prime p = prime(k) such that gcd( prime(k+1) - prime(k), prime(k+2) - prime(k+1) ) is a multiple of 2n.A054682
a(n) = smallest prime p = prime(k) such that gcd( prime(k+1) - prime(k), prime(k+2) - prime(k+1) ) is a multiple of 2n.
- Numbers whose sum of digits is even.A054683
Numbers whose sum of digits is even.
- Numbers whose sum of digits is odd.A054684
Numbers whose sum of digits is odd.
- Number of partitions of n into distinct prime powers (1 not considered a power).A054685
Number of partitions of n into distinct prime powers (1 not considered a power).
- Multiset consisting of squares and triangular numbers.A054686
Multiset consisting of squares and triangular numbers.
- a(n+1) = 1 + Sum_{k=0..n} binomial(n,k)*a(k)*a(n-k) for n >= 0 with a(0) = 1.A054687
a(n+1) = 1 + Sum_{k=0..n} binomial(n,k)*a(k)*a(n-k) for n >= 0 with a(0) = 1.
- Number of nonnegative integer n X n matrices with sum of elements equal to n; polynomial symmetric functions of matrix of order n.A054688
Number of nonnegative integer n X n matrices with sum of elements equal to n; polynomial symmetric functions of matrix of order n.
- 6 consecutive primes differ by 2n or more starting at a(n).A054689
6 consecutive primes differ by 2n or more starting at a(n).
- n consecutive primes differ by 4 or more starting at a(n), or n consecutive primes with no twin primes.A054690
n consecutive primes differ by 4 or more starting at a(n), or n consecutive primes with no twin primes.
- New records in A054690 (start of n consecutive non-twin primes).A054691
New records in A054690 (start of n consecutive non-twin primes).
- Endpoints for runs of consecutive primes mentioned in A054691.A054692
Endpoints for runs of consecutive primes mentioned in A054691.
- n consecutive primes differ by 6 or more starting at a(n).A054693
n consecutive primes differ by 6 or more starting at a(n).
- n consecutive primes differ by 8 or more starting at a(n).A054694
n consecutive primes differ by 8 or more starting at a(n).
- n consecutive primes differ by 10 or more starting at a(n).A054695
n consecutive primes differ by 10 or more starting at a(n).
- n consecutive primes differ by 12 or more starting at a(n).A054696
n consecutive primes differ by 12 or more starting at a(n).
- 3 consecutive primes differ by 2n or more starting at a(n).A054697
3 consecutive primes differ by 2n or more starting at a(n).
- 4 consecutive primes differ by 2n or more starting at a(n).A054698
4 consecutive primes differ by 2n or more starting at a(n).
- 5 consecutive primes differ by 2n or more starting at a(n).A054699
5 consecutive primes differ by 2n or more starting at a(n).
- Number of 6-ary Lyndon words with trace 3 mod 6.A054700
Number of 6-ary Lyndon words with trace 3 mod 6.
- Smallest prime followed by three gaps that are multiples of 2n.A054701
Smallest prime followed by three gaps that are multiples of 2n.
- 5 consecutive primes differ by a multiple of 2n starting at a(n).A054702
5 consecutive primes differ by a multiple of 2n starting at a(n).
- Number of distinct powers of 2 modulo n.A054703
Number of distinct powers of 2 modulo n.
- Number of powers of 3 modulo n.A054704
Number of powers of 3 modulo n.
- Number of powers of 4 modulo n.A054705
Number of powers of 4 modulo n.
- Number of powers of 5 modulo n.A054706
Number of powers of 5 modulo n.
- Number of powers of 6 modulo n.A054707
Number of powers of 6 modulo n.
- Number of powers of 7 modulo n.A054708
Number of powers of 7 modulo n.
- Number of powers of 8 modulo n.A054709
Number of powers of 8 modulo n.
- Number of powers of 10 mod n.A054710
Number of powers of 10 mod n.