Sequences
392,541 sequences
- Number of positive braids with n crossings of 5 strands.A054761
Number of positive braids with n crossings of 5 strands.
- a(n) is a cube mod a(i) for all i < n.A054762
a(n) is a cube mod a(i) for all i < n.
- Residues of consecutive prime differences modulo 6.A054763
Residues of consecutive prime differences modulo 6.
- Degree of numerator and denominator of n-th order susceptibility series for 2-dimensional Ising model.A054764
Degree of numerator and denominator of n-th order susceptibility series for 2-dimensional Ising model.
- a(n+2) = (2n+3)*a(n+1) + (n+1)^2*a(n), a(0) = 0, a(1) = 1.A054765
a(n+2) = (2n+3)*a(n+1) + (n+1)^2*a(n), a(0) = 0, a(1) = 1.
- a(n+2) = (2*n + 3)*a(n+1) + (n + 1)^2*a(n), a(0) = 1, a(1) = 0.A054766
a(n+2) = (2*n + 3)*a(n+1) + (n + 1)^2*a(n), a(0) = 1, a(1) = 0.
- Period of the sequence of Bell numbers A000110 (mod n).A054767
Period of the sequence of Bell numbers A000110 (mod n).
- a(n+2) = (2n+3)*a(n+1) + (n+1)^2*a(n).A054768
a(n+2) = (2n+3)*a(n+1) + (n+1)^2*a(n).
- Number of integer n-tuples {x(1),x(2),...,x(n)} with the following properties: (1) x(1)=1 and, for k>1, if d=x(k)-x(k-1), then (2) d is relatively prime to x(k-1) and (3) d=x(i) for some i in {1,2,...,k-1}.A054769
Number of integer n-tuples {x(1),x(2),...,x(n)} with the following properties: (1) x(1)=1 and, for k>1, if d=x(k)-x(k-1), then (2) d is relatively prime to x(k-1) and (3) d=x(i) for some i in {1,2,...,k-1}.
- Numbers that are not the sum of distinct Lucas numbers 1,3,4,7,11, ... (A000204).A054770
Numbers that are not the sum of distinct Lucas numbers 1,3,4,7,11, ... (A000204).
- Number of nonnegative integer 3 X 3 matrices with sum of elements equal to n, up to rotational symmetry.A054771
Number of nonnegative integer 3 X 3 matrices with sum of elements equal to n, up to rotational symmetry.
- Triangle T(n,k) of n X n binary matrices with k=0..n^2 ones, up to rotational symmetry.A054772
Triangle T(n,k) of n X n binary matrices with k=0..n^2 ones, up to rotational symmetry.
- Number of nonnegative integer 4 X 4 matrices with sum of elements equal to n, up to rotational symmetry.A054773
Number of nonnegative integer 4 X 4 matrices with sum of elements equal to n, up to rotational symmetry.
- Numbers of the form 2^i*5^j where i+j is odd.A054774
Numbers of the form 2^i*5^j where i+j is odd.
- Positive multiples of 6 which are not the midpoint of a pair of twin primes.A054775
Positive multiples of 6 which are not the midpoint of a pair of twin primes.
- a(n) = 3*n*(3*n-1)*(3*n-2).A054776
a(n) = 3*n*(3*n-1)*(3*n-2).
- a(n) = 4*n*(4*n-1)*(4*n-2)*(4*n-3).A054777
a(n) = 4*n*(4*n-1)*(4*n-2)*(4*n-3).
- a(n) = 5n*(5n-1)*(5n-2)*(5n-3)*(5n-4).A054778
a(n) = 5n*(5n-1)*(5n-2)*(5n-3)*(5n-4).
- 6n*(6n-1)*(6n-2)*(6n-3)*(6n-4)*(6n-5).A054779
6n*(6n-1)*(6n-2)*(6n-3)*(6n-4)*(6n-5).
- Number of n-covers of a labeled n-set.A054780
Number of n-covers of a labeled n-set.
- First position of n in continued fraction for Khinchin's constant.A054781
First position of n in continued fraction for Khinchin's constant.
- Number of primes <= the n-th Fibonacci number.A054782
Number of primes <= the n-th Fibonacci number.
- (n^2)-th Fibonacci number.A054783
(n^2)-th Fibonacci number.
- Integers n such that sigma(2n) - sigma(n) is a power of 2, where sigma is the sum of the divisors of n.A054784
Integers n such that sigma(2n) - sigma(n) is a power of 2, where sigma is the sum of the divisors of n.
- a(n) = sigma(2n) - sigma(n), where sigma is the sum of divisors of n, A000203.A054785
a(n) = sigma(2n) - sigma(n), where sigma is the sum of divisors of n, A000203.
- Earliest sequence with a(a(n)) = 6n.A054786
Earliest sequence with a(a(n)) = 6n.
- Earliest sequence with a(a(n))=7n.A054787
Earliest sequence with a(a(n))=7n.
- Earliest sequence with a(a(n))=8n.A054788
Earliest sequence with a(a(n))=8n.
- Earliest sequence with a(a(n)) = 9n.A054789
Earliest sequence with a(a(n)) = 9n.
- Earliest sequence with a(a(n))=10n.A054790
Earliest sequence with a(a(n))=10n.
- Earliest sequence with a(a(n)) = n^2.A054791
Earliest sequence with a(a(n)) = n^2.
- Earliest sequence with a(a(n)) = n^3.A054792
Earliest sequence with a(a(n)) = n^3.
- Earliest sequence with a(a(n)) = n^4.A054793
Earliest sequence with a(a(n)) = n^4.
- Numbers of form 5+n^2+n or 5+2*n^2.A054794
Numbers of form 5+n^2+n or 5+2*n^2.
- Numbers of form 23+n^2+n or 23+2*n^2.A054795
Numbers of form 23+n^2+n or 23+2*n^2.
- Numbers of form 17+n^2+n or 17+2*n^2.A054796
Numbers of form 17+n^2+n or 17+2*n^2.
- Smallest prime number whose digits sum to the n-th palindromic prime.A054797
Smallest prime number whose digits sum to the n-th palindromic prime.
- Let N(k) and D(k) be the sequences defined in A054765 and A012244; write N(k)* D(k+j ) - N(k+j)*D(k) = (-1)^(k+1)*(k!)^2*P(k) where P(k) is a polynomial in k of degree j-1; sequence gives coefficients of expansion of P(k) in powers of k for j=1,2,3,...A054798
Let N(k) and D(k) be the sequences defined in A054765 and A012244; write N(k)* D(k+j ) - N(k+j)*D(k) = (-1)^(k+1)*(k!)^2*P(k) where P(k) is a polynomial in k of degree j-1; sequence gives coefficients of expansion of P(k) in powers of k for j=1,2,3,...
- Integers n such that sigma(n+2) = sigma(n) + 2, where sigma = A000203, the sum of divisors of n.A054799
Integers n such that sigma(n+2) = sigma(n) + 2, where sigma = A000203, the sum of divisors of n.
- First term of balanced prime quartets: p(m+1)-p(m) = p(m+2)-p(m+1) = p(m+3)-p(m+2).A054800
First term of balanced prime quartets: p(m+1)-p(m) = p(m+2)-p(m+1) = p(m+3)-p(m+2).
- Second term of balanced prime quartets: p(m)-p(m-1) = p(m+1)-p(m) = p(m+2)-p(m+1).A054801
Second term of balanced prime quartets: p(m)-p(m-1) = p(m+1)-p(m) = p(m+2)-p(m+1).
- Third term of balanced prime quartets: p(m-1)-p(m-2) = p(m)-p(m-1) = p(m+1)-p(m).A054802
Third term of balanced prime quartets: p(m-1)-p(m-2) = p(m)-p(m-1) = p(m+1)-p(m).
- Fourth term of balanced prime quartets: p(m-2)-p(m-3) = p(m-1)-p(m-2) = p(m)-p(m-1).A054803
Fourth term of balanced prime quartets: p(m-2)-p(m-3) = p(m-1)-p(m-2) = p(m)-p(m-1).
- First term of strong prime quartets: prime(m+1)-prime(m) > prime(m+2)-prime(m+1) > prime(m+3)-prime(m+2).A054804
First term of strong prime quartets: prime(m+1)-prime(m) > prime(m+2)-prime(m+1) > prime(m+3)-prime(m+2).
- Second term of strong prime quartets: prime(m+1)-prime(m) > prime(m+2)-prime(m+1) > prime(m+3)-prime(m+2).A054805
Second term of strong prime quartets: prime(m+1)-prime(m) > prime(m+2)-prime(m+1) > prime(m+3)-prime(m+2).
- Third term of strong prime quartets: prime(m+1)-prime(m) > prime(m+2)-prime(m+1) > prime(m+3)-prime(m+2).A054806
Third term of strong prime quartets: prime(m+1)-prime(m) > prime(m+2)-prime(m+1) > prime(m+3)-prime(m+2).
- Fourth term of strong prime quartets: prime(m+1)-prime(m) > prime(m+2)-prime(m+1) > prime(m+3)-prime(m+2).A054807
Fourth term of strong prime quartets: prime(m+1)-prime(m) > prime(m+2)-prime(m+1) > prime(m+3)-prime(m+2).
- First term of strong prime quintets: p(m+1)-p(m) > p(m+2)-p(m+1) > p(m+3)-p(m+2) > p(m+4)-p(m+3).A054808
First term of strong prime quintets: p(m+1)-p(m) > p(m+2)-p(m+1) > p(m+3)-p(m+2) > p(m+4)-p(m+3).
- Second term of strong prime 5-tuples: p(m)-p(m-1) > p(m+1)-p(m) > p(m+2)-p(m+1) > p(m+3)-p(m+2).A054809
Second term of strong prime 5-tuples: p(m)-p(m-1) > p(m+1)-p(m) > p(m+2)-p(m+1) > p(m+3)-p(m+2).
- Third term of strong prime 5-tuples: p(m-1)-p(m-2) > p(m)-p(m-1) > p(m+1)-p(m) > p(m+2)-p(m+1).A054810
Third term of strong prime 5-tuples: p(m-1)-p(m-2) > p(m)-p(m-1) > p(m+1)-p(m) > p(m+2)-p(m+1).