Sequences
392,541 sequences
- a(n) = Sum_{i=0..n} K(n, i) where K(x, y) is the Kronecker symbol (x / y).A071961
a(n) = Sum_{i=0..n} K(n, i) where K(x, y) is the Kronecker symbol (x / y).
- Number of double points of the map that, for each term t of a sequence, counts the preceding terms that are greater than or equal to t.A071962
Number of double points of the map that, for each term t of a sequence, counts the preceding terms that are greater than or equal to t.
- Largest prime factor of p(n), the n-th partition number A000041(n) (with a(0) = a(1) = 1 by convention).A071963
Largest prime factor of p(n), the n-th partition number A000041(n) (with a(0) = a(1) = 1 by convention).
- Numbers k such that k = Gpf(k) * Gpf(phi(k)) where Gpf(k) = A006530(k) is the greatest prime factor of k.A071964
Numbers k such that k = Gpf(k) * Gpf(phi(k)) where Gpf(k) = A006530(k) is the greatest prime factor of k.
- Numbers k such that k = Gpf(k) * Gpf(sigma(k)) where Gpf(k) = A006530(k) is the greatest prime factor of k.A071965
Numbers k such that k = Gpf(k) * Gpf(sigma(k)) where Gpf(k) = A006530(k) is the greatest prime factor of k.
- Composite numbers such that smallest prime factor, largest prime factor and sum of prime factors (with repetition) are all a sum of two squares.A071966
Composite numbers such that smallest prime factor, largest prime factor and sum of prime factors (with repetition) are all a sum of two squares.
- Theta series of 9-dimensional odd unimodular lattice E_8 + Z.A071967
Theta series of 9-dimensional odd unimodular lattice E_8 + Z.
- Denominators of coefficients of expansion of arctan(x)^2 = x^2-2/3*x^4+23/45*x^6-44/105*x^8+563/1575*x^10-3254/10395*x^12+ ...A071968
Denominators of coefficients of expansion of arctan(x)^2 = x^2-2/3*x^4+23/45*x^6-44/105*x^8+563/1575*x^10-3254/10395*x^12+ ...
- a(n) = Sum_{k=0..floor(n/3)} (binomial(n+1, k)*binomial(2*n-3*k, n-3*k)/(n+1)).A071969
a(n) = Sum_{k=0..floor(n/3)} (binomial(n+1, k)*binomial(2*n-3*k, n-3*k)/(n+1)).
- List the positive rationals in the order in which they are produced by the Stern sequence A002487 and apply the Sagher map to turn them into integers.A071970
List the positive rationals in the order in which they are produced by the Stern sequence A002487 and apply the Sagher map to turn them into integers.
- a(1)=1, a(n) is the smallest integer > a(n-1) such that the sum of elements of the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n^3.A071971
a(1)=1, a(n) is the smallest integer > a(n-1) such that the sum of elements of the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n^3.
- a(1)=1, a(n) is the smallest integer > a(n-1) such that the sum of elements of the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n^4.A071972
a(1)=1, a(n) is the smallest integer > a(n-1) such that the sum of elements of the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n^4.
- Number of primes less than or equal to Pi^n.A071973
Number of primes less than or equal to Pi^n.
- Numerator of rational number i/j such that Sagher map sends i/j to n.A071974
Numerator of rational number i/j such that Sagher map sends i/j to n.
- Denominator of rational number i/j such that Sagher map sends i/j to n.A071975
Denominator of rational number i/j such that Sagher map sends i/j to n.
- Number of lists of length n from {0..9} summing to n but not beginning with 0.A071976
Number of lists of length n from {0..9} summing to n but not beginning with 0.
- Triangle in which first row is {1}; to get n-th row take first n numbers greater than last number in previous row which are relatively prime to n.A071977
Triangle in which first row is {1}; to get n-th row take first n numbers greater than last number in previous row which are relatively prime to n.
- Right diagonal of A071977.A071978
Right diagonal of A071977.
- Left diagonal of A071977.A071979
Left diagonal of A071977.
- If n = abcd (say) in decimal, then a(n) = a + ab + abc + abcd + bcd + cd + d.A071980
If n = abcd (say) in decimal, then a(n) = a + ab + abc + abcd + bcd + cd + d.
- Parity of the digits of e in base 10.A071981
Parity of the digits of e in base 10.
- Parity of the decimal digits of sqrt(2).A071982
Parity of the decimal digits of sqrt(2).
- Square chains: the number of permutations (reversals not counted as different) of the numbers 1 to n such that the sum of any two consecutive numbers is a square.A071983
Square chains: the number of permutations (reversals not counted as different) of the numbers 1 to n such that the sum of any two consecutive numbers is a square.
- Square loops: the number of circular permutations (reversals not counted as different) of the numbers 1 to n such that the sum of any two consecutive numbers is a square.A071984
Square loops: the number of circular permutations (reversals not counted as different) of the numbers 1 to n such that the sum of any two consecutive numbers is a square.
- a(n) is the smallest positive integer that cannot be obtained using at most n-1 of the integers {1, 2, ..., n} using each number at most once and the operators +, -, *, /.A071985
a(n) is the smallest positive integer that cannot be obtained using at most n-1 of the integers {1, 2, ..., n} using each number at most once and the operators +, -, *, /.
- Parity of the prime-counting function pi(n).A071986
Parity of the prime-counting function pi(n).
- 225 written in base 15-n.A071987
225 written in base 15-n.
- Triple Peano sequence: a list of triples (x,y,z) starting at (1,1,1); then x'=x+1, y'=y+x, z'=z+y, for x only ranging over the primes.A071988
Triple Peano sequence: a list of triples (x,y,z) starting at (1,1,1); then x'=x+1, y'=y+x, z'=z+y, for x only ranging over the primes.
- a(n) = n-th decimal digit of the fractional part of the square root of the n-th nonsquare number (A000037).A071989
a(n) = n-th decimal digit of the fractional part of the square root of the n-th nonsquare number (A000037).
- Numerators of the partial sums of the reciprocals of the upper members of twin prime pairs.A071990
Numerators of the partial sums of the reciprocals of the upper members of twin prime pairs.
- a(1) = a(2) = 1; a(n) = a(floor(n/3)) + a(n - floor(n/3)).A071991
a(1) = a(2) = 1; a(n) = a(floor(n/3)) + a(n - floor(n/3)).
- a(n) = 3*n^2 + 2*n - 4 * Sum_{k=1..n} A003159(k).A071992
a(n) = 3*n^2 + 2*n - 4 * Sum_{k=1..n} A003159(k).
- a(n) = 3*n - 2* A003159(n).A071993
a(n) = 3*n - 2* A003159(n).
- a(n) = Sum_{k=1..n} A003159(k).A071994
a(n) = Sum_{k=1..n} A003159(k).
- a(1) = 1, a(2) = 0, a(n) = a(floor(n/3)) + a(n - floor(n/3)).A071995
a(1) = 1, a(2) = 0, a(n) = a(floor(n/3)) + a(n - floor(n/3)).
- a(1) = 0, a(2) = 1, a(n) = a(floor(n/3)) + a(n - floor(n/3)).A071996
a(1) = 0, a(2) = 1, a(n) = a(floor(n/3)) + a(n - floor(n/3)).
- a(n) is the smallest positive integer that cannot be obtained by using the number 2 at most n times and the operators +, -, *, /.A071997
a(n) is the smallest positive integer that cannot be obtained by using the number 2 at most n times and the operators +, -, *, /.
- Write n in binary, interpret that as a decimal number, convert back to binary.A071998
Write n in binary, interpret that as a decimal number, convert back to binary.
- Determinant of n X n matrix whose element A(i,j) is 1 if i=j, i if n=i+j and 0 otherwise.A071999
Determinant of n X n matrix whose element A(i,j) is 1 if i=j, i if n=i+j and 0 otherwise.
- Number of semiprimes (A001358) <= n.A072000
Number of semiprimes (A001358) <= n.
- Variant of the factorial base representation of n.A072001
Variant of the factorial base representation of n.
- Highest prime dividing the least n-multiperfect number (A007539).A072002
Highest prime dividing the least n-multiperfect number (A007539).
- 10's complement of final digit of n-th prime.A072003
10's complement of final digit of n-th prime.
- Remainder when sum of squares of first n primes is divided by n-th prime.A072004
Remainder when sum of squares of first n primes is divided by n-th prime.
- Smallest solution to gcd(k, reverse(k)) = 3^n.A072005
Smallest solution to gcd(k, reverse(k)) = 3^n.
- Number of terms in InversePhi set of prime(n)*(prime(n)-1) = phi(p(n)^2), where prime(n) is the n-th prime and phi=A000010.A072006
Number of terms in InversePhi set of prime(n)*(prime(n)-1) = phi(p(n)^2), where prime(n) is the n-th prime and phi=A000010.
- a(0) = 0; for n>=1, a(n)=least nonnegative integer x such that |x-a(n-1)|>=n and x is not a(k) for any k<n.A072007
a(0) = 0; for n>=1, a(n)=least nonnegative integer x such that |x-a(n-1)|>=n and x is not a(k) for any k<n.
- a(n)=b(3n+1), where b=A072007.A072008
a(n)=b(3n+1), where b=A072007.
- Inverse of permutation A072007.A072009
Inverse of permutation A072007.
- In prime factorization of n replace all primes of form k*4+1 with k*4+3 and primes of form k*4+3 with k*4+1.A072010
In prime factorization of n replace all primes of form k*4+1 with k*4+3 and primes of form k*4+3 with k*4+1.