Sequences
392,541 sequences
- Average (scaled by a certain explicit factor) over all integers k of a_k(n), the n-th coefficient of the k-th cyclotomic polynomial.A086811
Average (scaled by a certain explicit factor) over all integers k of a_k(n), the n-th coefficient of the k-th cyclotomic polynomial.
- Number of symmetric invertible n X n matrices over GF(2).A086812
Number of symmetric invertible n X n matrices over GF(2).
- a(1)=1 then a(n)= (1/2) *(5*a(n-1)+1) if a(n-1) is odd, a(n)=3/2*a(n-1) otherwise.A086813
a(1)=1 then a(n)= (1/2) *(5*a(n-1)+1) if a(n-1) is odd, a(n)=3/2*a(n-1) otherwise.
- a(n) = ceiling( (1 + n + 2*n^2 + 4*n^3)/(1 + 2*n + n^2) ).A086814
a(n) = ceiling( (1 + n + 2*n^2 + 4*n^3)/(1 + 2*n + n^2) ).
- a(n)=(n-1)*n^(2*n).A086815
a(n)=(n-1)*n^(2*n).
- Smaller member of a twin prime pair with a triangular sum.A086816
Smaller member of a twin prime pair with a triangular sum.
- a(n) is the number of terms in the expansion of (x+y-z)*(x^2+y^2-z^2)*(x^3+y^3-z^3)*...*(x^n+y^n-z^n).A086817
a(n) is the number of terms in the expansion of (x+y-z)*(x^2+y^2-z^2)*(x^3+y^3-z^3)*...*(x^n+y^n-z^n).
- a(1) = 111, a(n) = the smallest squarefree number > a(n-1) which contains all the digits of a(n-1).A086818
a(1) = 111, a(n) = the smallest squarefree number > a(n-1) which contains all the digits of a(n-1).
- Decimal expansion of Lochs's constant.A086819
Decimal expansion of Lochs's constant.
- Continued fraction expansion of Lochs constant.A086820
Continued fraction expansion of Lochs constant.
- Duplicate of A007576.A086821
Duplicate of A007576.
- a(n) = floor((6*n^0+5*n^1+4*n^2+3*n^3) / (1*n^0+1*n^1+1*n^2)).A086822
a(n) = floor((6*n^0+5*n^1+4*n^2+3*n^3) / (1*n^0+1*n^1+1*n^2)).
- Coefficient of x^2 in the n-th cyclotomic polynomial. (The same as the coefficient of x^(phi(n)-2) ).A086823
Coefficient of x^2 in the n-th cyclotomic polynomial. (The same as the coefficient of x^(phi(n)-2) ).
- Least positive k such that k! >= n^k.A086824
Least positive k such that k! >= n^k.
- Number of knots (prime or composite) with n crossings.A086825
Number of knots (prime or composite) with n crossings.
- Number of nonsplittable links (prime or composite) with n crossings.A086826
Number of nonsplittable links (prime or composite) with n crossings.
- Smaller member of a twin prime pair such that the sum sets a record for number of prime divisors (counted with multiplicity).A086827
Smaller member of a twin prime pair such that the sum sets a record for number of prime divisors (counted with multiplicity).
- a(1) = 0, a(2) = 1, a(3) = 1, a(4) = 7; thereafter, a(n) = a(n-1) + (n-1)*a(n-2).A086828
a(1) = 0, a(2) = 1, a(3) = 1, a(4) = 7; thereafter, a(n) = a(n-1) + (n-1)*a(n-2).
- Number of n X n matrices on n^2 distinct symbols modulo rotations and reflections.A086829
Number of n X n matrices on n^2 distinct symbols modulo rotations and reflections.
- Orders of the non-Abelian groups in sequence A086792.A086830
Orders of the non-Abelian groups in sequence A086792.
- Ramanujan sum c_n(2).A086831
Ramanujan sum c_n(2).
- Number of ways to tile an n X n board having a black border with the following 1 X 1 tiles: bbbb, bbww, wbbw, bwwb, wwbb, where the colors are read clockwise around each tile.A086832
Number of ways to tile an n X n board having a black border with the following 1 X 1 tiles: bbbb, bbww, wbbw, bwwb, wwbb, where the colors are read clockwise around each tile.
- Minimum number of different addends occurring in any shortest addition chain of Brauer type for a given n, or 0 if n has no shortest addition chain of Brauer type.A086833
Minimum number of different addends occurring in any shortest addition chain of Brauer type for a given n, or 0 if n has no shortest addition chain of Brauer type.
- Smallest prime that is the smallest of at least two consecutive primes with sum=n; a(n)=0 if no consecutive primes with sum=n exist.A086834
Smallest prime that is the smallest of at least two consecutive primes with sum=n; a(n)=0 if no consecutive primes with sum=n exist.
- a(n) = a( (n - a(n-1))*(n mod 2) + a(n-1)*(1 - (n mod 2)) ) + a( (n - a(n-2))*(n mod 2) + (n - a(n-1))*(1 - (n mod 2)) ), with a(1) = a(2) = 1.A086835
a(n) = a( (n - a(n-1))*(n mod 2) + a(n-1)*(1 - (n mod 2)) ) + a( (n - a(n-2))*(n mod 2) + (n - a(n-1))*(1 - (n mod 2)) ), with a(1) = a(2) = 1.
- On a 3 X 3 board, number of distinct positions of n digits (modulo rotation/reflection).A086836
On a 3 X 3 board, number of distinct positions of n digits (modulo rotation/reflection).
- Brilliant Sarrus numbers.A086837
Brilliant Sarrus numbers.
- Indices k where A057176(k) = 4.A086838
Indices k where A057176(k) = 4.
- Number of steps needed to reverse a pattern of length 2*n of cellular automaton Rule 90.A086839
Number of steps needed to reverse a pattern of length 2*n of cellular automaton Rule 90.
- Resultant of the polynomial x^n-1 and the Chebyshev polynomial of the first kind T_n(x).A086840
Resultant of the polynomial x^n-1 and the Chebyshev polynomial of the first kind T_n(x).
- a(n) = a((a(n-2))*mod(n,2)+a(n-1)*(1-mod(n,2))) + a((n - a(n-2))*mod(n,2)+(n-a(n-1))*(1-mod(n,2))).A086841
a(n) = a((a(n-2))*mod(n,2)+a(n-1)*(1-mod(n,2))) + a((n - a(n-2))*mod(n,2)+(n-a(n-1))*(1-mod(n,2))).
- Number of n-node prime P5-free chordal graphs which are not split.A086842
Number of n-node prime P5-free chordal graphs which are not split.
- Odd numbers m such that the sequence defined by b(1) = m; for k>1, b(k) = floor(phi*b(k-1)), where phi = (1 + sqrt(5))/2, contains only odd numbers.A086843
Odd numbers m such that the sequence defined by b(1) = m; for k>1, b(k) = floor(phi*b(k-1)), where phi = (1 + sqrt(5))/2, contains only odd numbers.
- Odd numbers m such that the sequence defined by b(1) = m; for k>1, b(k) = floor((1+sqrt(3))*b(k-1)) contains only odd numbers.A086844
Odd numbers m such that the sequence defined by b(1) = m; for k>1, b(k) = floor((1+sqrt(3))*b(k-1)) contains only odd numbers.
- a(1) = 0, a(n) = a(floor(n/2)) + 2*a(ceiling(n/2)) + floor(n/2).A086845
a(1) = 0, a(n) = a(floor(n/2)) + 2*a(ceiling(n/2)) + floor(n/2).
- Number of brilliant numbers < 10^n.A086846
Number of brilliant numbers < 10^n.
- a(n) = gcd(A001608(n), n), where A001608 = Perrin sequence.A086847
a(n) = gcd(A001608(n), n), where A001608 = Perrin sequence.
- First differences are formed by interleaving {2^k - 1, k = 1, 2, 3, ...} and {11*k, k = 5, 4, 3, ...}.A086848
First differences are formed by interleaving {2^k - 1, k = 1, 2, 3, ...} and {11*k, k = 5, 4, 3, ...}.
- Sum of first n nonsquares.A086849
Sum of first n nonsquares.
- Determinant of the n X n matrix K(i,j) where K(i,j) is the Kronecker symbol (a(n) = 0 for n>=8).A086850
Determinant of the n X n matrix K(i,j) where K(i,j) is the Kronecker symbol (a(n) = 0 for n>=8).
- a(0) = 1, a(n+1) = a(n)^2 - n.A086851
a(0) = 1, a(n+1) = a(n)^2 - n.
- Number of permutations of length n with exactly 1 rising or falling succession.A086852
Number of permutations of length n with exactly 1 rising or falling succession.
- Number of permutations of length n with exactly 2 rising or falling successions.A086853
Number of permutations of length n with exactly 2 rising or falling successions.
- Number of permutations of length n with exactly 3 rising or falling successions.A086854
Number of permutations of length n with exactly 3 rising or falling successions.
- Number of permutations of length n with exactly 4 rising or falling successions.A086855
Number of permutations of length n with exactly 4 rising or falling successions.
- Triangle read by rows: T(n,k) = one-half number of permutations of length n with exactly k rising or falling successions, for n >= 1, 0 <= k <= n-1. T(1,0) = 1 by convention.A086856
Triangle read by rows: T(n,k) = one-half number of permutations of length n with exactly k rising or falling successions, for n >= 1, 0 <= k <= n-1. T(1,0) = 1 by convention.
- a(0) = 0, a(1) = 1; for n > 1, a(n) = (a(n-1) + a(n-2) + 1)^2.A086857
a(0) = 0, a(1) = 1; for n > 1, a(n) = (a(n-1) + a(n-2) + 1)^2.
- Let f(n) be the inverse of the function g(x) = x^x. Then a(n) = floor(f(n)).A086858
Let f(n) be the inverse of the function g(x) = x^x. Then a(n) = floor(f(n)).
- a(n) = number of elements of order n in simple group L_2(8) of order 504.A086859
a(n) = number of elements of order n in simple group L_2(8) of order 504.
- Numbers in A086473 corresponding to the unique product of two numbers having the unique sum of A086533.A086860
Numbers in A086473 corresponding to the unique product of two numbers having the unique sum of A086533.