Sequences
392,541 sequences
- Numbers k such that k-th cyclotomic polynomial has exactly 5 nonzero terms.A086761
Numbers k such that k-th cyclotomic polynomial has exactly 5 nonzero terms.
- A piecewise recurrence relation with a(2)=7 and for n>=2: if a(n) is prime, not 31, a(n+1) = A000265(3*a(n)+1); if a(n) is odd composite, not 1, a(n+1) = A000265(a(n)+1); if a(n) is even, a(n+1) = A000265(a(n)); if a(n) is 1 or 31, find the number S(n) of occurrences of 1 and 31 among a(2),a(3),...,a(n) and compute a(n+1) by the above rules as if a(n) were 2+S(n), unless 2+S(n)=31, in which case a(n+1)=47.A086762
A piecewise recurrence relation with a(2)=7 and for n>=2: if a(n) is prime, not 31, a(n+1) = A000265(3*a(n)+1); if a(n) is odd composite, not 1, a(n+1) = A000265(a(n)+1); if a(n) is even, a(n+1) = A000265(a(n)); if a(n) is 1 or 31, find the number S(n) of occurrences of 1 and 31 among a(2),a(3),...,a(n) and compute a(n+1) by the above rules as if a(n) were 2+S(n), unless 2+S(n)=31, in which case a(n+1)=47.
- Count of complete evaluations of each mapping in the trajectory of n in the mapping n-> n*3+1 if n is prime, n+1 if n is odd composite, n/2 while n even.A086763
Count of complete evaluations of each mapping in the trajectory of n in the mapping n-> n*3+1 if n is prime, n+1 if n is odd composite, n/2 while n even.
- Triangle T(n, k), read by row, related to Euler's difference table A068106 (divide column k of A068106 by k!).A086764
Triangle T(n, k), read by row, related to Euler's difference table A068106 (divide column k of A068106 by k!).
- Number of positive coefficients in n-th cyclotomic polynomial.A086765
Number of positive coefficients in n-th cyclotomic polynomial.
- a(n) = smallest r where (concatenation of n, r times with itself)*10 + 1 is a prime given by A087403(n), or 0 if no such number exists.A086766
a(n) = smallest r where (concatenation of n, r times with itself)*10 + 1 is a prime given by A087403(n), or 0 if no such number exists.
- Last coefficient of the last term in the numerator of the simplified expansion of the solutions of FLT for n=2 for FLT n=1,2,3,..A086767
Last coefficient of the last term in the numerator of the simplified expansion of the solutions of FLT for n=2 for FLT n=1,2,3,..
- Number of conjugacy classes in the group GL(3,Z_n).A086768
Number of conjugacy classes in the group GL(3,Z_n).
- a(n) = Sum_{i=1..n} 2^(b(i) - 1), where b(n) is the differences between consecutive primes.A086769
a(n) = Sum_{i=1..n} 2^(b(i) - 1), where b(n) is the differences between consecutive primes.
- Numbers k such that the difference between the largest and the smallest prime divisor of k equals the number of prime divisors of k (counted with multiplicity).A086770
Numbers k such that the difference between the largest and the smallest prime divisor of k equals the number of prime divisors of k (counted with multiplicity).
- Prime links (not necessarily connected knots) with n crossings.A086771
Prime links (not necessarily connected knots) with n crossings.
- Store the natural numbers in a triangular array such that values on each row have the same number of bits. Start a new row with the smallest number not yet recorded. a(n) represents the initial terms in the resulting array.A086772
Store the natural numbers in a triangular array such that values on each row have the same number of bits. Start a new row with the smallest number not yet recorded. a(n) represents the initial terms in the resulting array.
- Decimal expansion of the continued fraction 1/(Pi+1/(Pi+1/(Pi+1/(Pi+...)))).A086773
Decimal expansion of the continued fraction 1/(Pi+1/(Pi+1/(Pi+1/(Pi+...)))).
- Decimal expansion of the number defined by the continued fraction shown below.A086774
Decimal expansion of the number defined by the continued fraction shown below.
- Decimal expansion of the number defined by the continued fraction shown below.A086775
Decimal expansion of the number defined by the continued fraction shown below.
- Smaller member of a prime pair (n, n+6) with a square sum.A086776
Smaller member of a prime pair (n, n+6) with a square sum.
- Decimal expansion of sqrt(10) - Pi.A086777
Decimal expansion of sqrt(10) - Pi.
- Number of n X n matrices over GF(5) with rank n-1.A086778
Number of n X n matrices over GF(5) with rank n-1.
- Numbers k such that k-th cyclotomic polynomial has exactly 7 nonzero terms.A086779
Numbers k such that k-th cyclotomic polynomial has exactly 7 nonzero terms.
- Number of negative terms in n-th cyclotomic polynomial.A086780
Number of negative terms in n-th cyclotomic polynomial.
- a(n) is the number of nonzero terms in the expansion of (x-y) * (x^2-y^2) * (x^3-y^3) * ... * (x^n-y^n).A086781
a(n) is the number of nonzero terms in the expansion of (x-y) * (x^2-y^2) * (x^3-y^3) * ... * (x^n-y^n).
- Sum of the degrees of the irreducible representations of the group GL(3,Z_n).A086782
Sum of the degrees of the irreducible representations of the group GL(3,Z_n).
- Discriminant of the polynomial x^n - 1.A086783
Discriminant of the polynomial x^n - 1.
- Number of non-trailing zeros in binary representation of n.A086784
Number of non-trailing zeros in binary representation of n.
- Primes found among the numerators of the continued fraction rational approximations to Pi.A086785
Primes found among the numerators of the continued fraction rational approximations to Pi.
- Triangle read by rows: n-th row is the smallest set of n numbers in arithmetic progression with the same prime signature.A086786
Triangle read by rows: n-th row is the smallest set of n numbers in arithmetic progression with the same prime signature.
- a(n) = Sum_{i=1..n} ( Sum_{j=1..n} i^j ).A086787
a(n) = Sum_{i=1..n} ( Sum_{j=1..n} i^j ).
- Primes found among the denominators of the continued fraction rational approximations to Pi.A086788
Primes found among the denominators of the continued fraction rational approximations to Pi.
- Duplicate of A066537.A086789
Duplicate of A066537.
- a(n) = floor((1+n+2*n^2+4*n^3)/(1+2*n+n^2)).A086790
a(n) = floor((1+n+2*n^2+4*n^3)/(1+2*n+n^2)).
- Primes found among the numerators of the continued fraction rational approximations to e.A086791
Primes found among the numerators of the continued fraction rational approximations to e.
- Orders of finite groups G with the property that the sum of the orders of all the proper normal subgroups of G equals the order of G.A086792
Orders of finite groups G with the property that the sum of the orders of all the proper normal subgroups of G equals the order of G.
- Number of iterations of the map A034690 (x -> sum of digits of all divisors of x) required to reach one of the fixed points, 15 or 1.A086793
Number of iterations of the map A034690 (x -> sum of digits of all divisors of x) required to reach one of the fixed points, 15 or 1.
- Numbers k such that the k-th cyclotomic polynomial has exactly 9 nonzero terms.A086794
Numbers k such that the k-th cyclotomic polynomial has exactly 9 nonzero terms.
- a(n) is the number of terms in the expansion of (x-2y)*(x^2-2y^2)*(x^3-2y^3)*...*(x^n-2y^n).A086795
a(n) is the number of terms in the expansion of (x-2y)*(x^2-2y^2)*(x^3-2y^3)*...*(x^n-2y^n).
- 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).A086796
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).
- Discriminant of the polynomial x^n - x - 1.A086797
Discriminant of the polynomial x^n - x - 1.
- Number of coefficients equal to zero in n-th cyclotomic polynomial.A086798
Number of coefficients equal to zero in n-th cyclotomic polynomial.
- Replace all trailing 0's with 1's in binary representation of n.A086799
Replace all trailing 0's with 1's in binary representation of n.
- Triangle read by rows in which row n lists differences between prime(n) and prime(k) for 1 <= k <= n.A086800
Triangle read by rows in which row n lists differences between prime(n) and prime(k) for 1 <= k <= n.
- a(n) = prime(n) - 3.A086801
a(n) = prime(n) - 3.
- Triangle read by rows in which row n lists (prime(n)-prime(k))/2 for 2 <= k <= n.A086802
Triangle read by rows in which row n lists (prime(n)-prime(k))/2 for 2 <= k <= n.
- a(n) = Product_{i=2..n} (prime(n+1)-prime(i)).A086803
a(n) = Product_{i=2..n} (prime(n+1)-prime(i)).
- a(0)=0; for n > 0, a(n) = (n+1)^(n-2)*2^(n^2).A086804
a(0)=0; for n > 0, a(n) = (n+1)^(n-2)*2^(n^2).
- Primes in the numerator of the continued fraction rational approximation of zeta(3).A086805
Primes in the numerator of the continued fraction rational approximation of zeta(3).
- Sarrus numbers k such that k-1 and k+1 have the same number of prime divisors (counted with multiplicity).A086806
Sarrus numbers k such that k-1 and k+1 have the same number of prime divisors (counted with multiplicity).
- Erroneous version of A000213.A086807
Erroneous version of A000213.
- Sum of the entries in the character table of the alternating group A_n.A086808
Sum of the entries in the character table of the alternating group A_n.
- Indices k where A057176(k) = 2.A086809
Indices k where A057176(k) = 2.
- Triangle obtained by adding a leading diagonal 1,0,0,0,... to A033282.A086810
Triangle obtained by adding a leading diagonal 1,0,0,0,... to A033282.