Sequences
392,541 sequences
- a(n) = A063660(n) - n.A063661
a(n) = A063660(n) - n.
- Starting with 0, select the next number having in decimal notation at least one common digit.A063662
Starting with 0, select the next number having in decimal notation at least one common digit.
- Numbers which can be written as b^2*c^2*(b^2+c^2).A063663
Numbers which can be written as b^2*c^2*(b^2+c^2).
- Numbers whose reciprocal is the sum of two reciprocals of squares.A063664
Numbers whose reciprocal is the sum of two reciprocals of squares.
- Number of ways 1/n can be written as 1/x^2 + 1/y^2 with y >= x >= 1.A063665
Number of ways 1/n can be written as 1/x^2 + 1/y^2 with y >= x >= 1.
- Euclidean order types: number of realizable order types of n points in the plane.A063666
Euclidean order types: number of realizable order types of n points in the plane.
- Number of solutions of phi(x) = 12n + 2.A063667
Number of solutions of phi(x) = 12n + 2.
- Numbers of the form 12*k + 2 with nonempty inverse totient set.A063668
Numbers of the form 12*k + 2 with nonempty inverse totient set.
- Hypotenuses of reciprocal Pythagorean triangles: number of solutions to 1/(12n)^2 = 1/b^2 + 1/c^2 [with b >= c > 0]; also number of values of A020885 (with repetitions) which divide n.A063669
Hypotenuses of reciprocal Pythagorean triangles: number of solutions to 1/(12n)^2 = 1/b^2 + 1/c^2 [with b >= c > 0]; also number of values of A020885 (with repetitions) which divide n.
- Positions of nonzero coefficients in cyclotomic polynomial Phi_n(x), converted from binary to decimal.A063670
Positions of nonzero coefficients in cyclotomic polynomial Phi_n(x), converted from binary to decimal.
- Positions of nonzero coefficients in cyclotomic polynomial Phi_n(x), A063670 in binary.A063671
Positions of nonzero coefficients in cyclotomic polynomial Phi_n(x), A063670 in binary.
- Sequence A019320 in binary.A063672
Sequence A019320 in binary.
- Denominators of convergents to Pi by Farey fractions.A063673
Denominators of convergents to Pi by Farey fractions.
- Numerators of increasingly better rational approximations to Pi with increasing denominators (3/1, 13/4, 16/5, 19/6, 22/7, 179/57, ...)A063674
Numerators of increasingly better rational approximations to Pi with increasing denominators (3/1, 13/4, 16/5, 19/6, 22/7, 179/57, ...)
- Erroneous version of A000943.A063675
Erroneous version of A000943.
- a(1) = 1 and for n > 1 let a(n) = a(n-1) + m, where m is the arithmetic mean of the largest subset of all predecessors such that m is an integer and m is maximal.A063676
a(1) = 1 and for n > 1 let a(n) = a(n-1) + m, where m is the arithmetic mean of the largest subset of all predecessors such that m is an integer and m is maximal.
- Size of largest subset of {A063676(1), ......., A063676(n)} with an integer arithmetic mean.A063677
Size of largest subset of {A063676(1), ......., A063676(n)} with an integer arithmetic mean.
- Arithmetic mean of largest subset of {A063676(1), ......., A063676(n-1)} such that a(n) is an integer and a(n) is maximal.A063678
Arithmetic mean of largest subset of {A063676(1), ......., A063676(n-1)} such that a(n) is an integer and a(n) is maximal.
- Numbers k such that (3^k - 7)/2 is prime.A063679
Numbers k such that (3^k - 7)/2 is prime.
- Solutions to sigma(k) + 7 = sigma(k+7).A063680
Solutions to sigma(k) + 7 = sigma(k+7).
- Primes p such that 2p+7 is a power of three.A063681
Primes p such that 2p+7 is a power of three.
- Number of 2-trees rooted at an asymmetric end-edge.A063682
Number of 2-trees rooted at an asymmetric end-edge.
- Integers formed from the reduced residue sets of even numbers and Fibonacci numbers.A063683
Integers formed from the reduced residue sets of even numbers and Fibonacci numbers.
- Numbers k such that m(k!) = 2, where m(k) = mu(k) + mu(k+1) + mu(k+2).A063684
Numbers k such that m(k!) = 2, where m(k) = mu(k) + mu(k+1) + mu(k+2).
- Numbers k such that !k + phi(k) - 1 is prime.A063685
Numbers k such that !k + phi(k) - 1 is prime.
- Triangular array: T(n,k) is the number of binary necklaces (no turning over) of length n whose longest run of 1's has length k. Table begins at n=0, k=0.A063686
Triangular array: T(n,k) is the number of binary necklaces (no turning over) of length n whose longest run of 1's has length k. Table begins at n=0, k=0.
- Number of 2-trees rooted at any symmetric edge.A063687
Number of 2-trees rooted at any symmetric edge.
- Number of 2-trees rooted at a triangle.A063688
Number of 2-trees rooted at a triangle.
- Number of 2-trees rooted at a triangle with 3 similar edges.A063689
Number of 2-trees rooted at a triangle with 3 similar edges.
- Numbers n such that n-th prime - phi(n) - d(n) = (n+1)-th prime - phi(n+1) - d(n+1), where d(n) = number of divisors of n.A063690
Numbers n such that n-th prime - phi(n) - d(n) = (n+1)-th prime - phi(n+1) - d(n+1), where d(n) = number of divisors of n.
- Number of solutions to x^2 + y^2 + z^2 = n in positive integers.A063691
Number of solutions to x^2 + y^2 + z^2 = n in positive integers.
- Number of 2-trees rooted at a triangle with two similar edges.A063692
Number of 2-trees rooted at a triangle with two similar edges.
- Numbers k such that phi(k + d(k)) = phi(k) + d(k), where phi() = A000010(), d() = A000005().A063693
Numbers k such that phi(k + d(k)) = phi(k) + d(k), where phi() = A000010(), d() = A000005().
- Remove odd-positioned bits from the binary expansion of n.A063694
Remove odd-positioned bits from the binary expansion of n.
- Remove even-positioned bits from the binary expansion of n.A063695
Remove even-positioned bits from the binary expansion of n.
- Positions of positive coefficients in cyclotomic polynomial Phi_n(x), converted from binary to decimal.A063696
Positions of positive coefficients in cyclotomic polynomial Phi_n(x), converted from binary to decimal.
- Positions of positive coefficients in cyclotomic polynomial Phi_n(x), A063696 in binary.A063697
Positions of positive coefficients in cyclotomic polynomial Phi_n(x), A063696 in binary.
- Positions of negative coefficients in cyclotomic polynomial Phi_n(x), converted from binary to decimal. (The constant term in the least significant bit (bit-0), the term x in the next bit (bit-1) and so on).A063698
Positions of negative coefficients in cyclotomic polynomial Phi_n(x), converted from binary to decimal. (The constant term in the least significant bit (bit-0), the term x in the next bit (bit-1) and so on).
- Positions of negative coefficients in cyclotomic polynomial Phi_n(x), A063698 in binary.A063699
Positions of negative coefficients in cyclotomic polynomial Phi_n(x), A063698 in binary.
- Numbers k such that sigma(k + d(k)) = sigma(k) + d(k), where sigma() = A000203(), d() = A000005().A063700
Numbers k such that sigma(k + d(k)) = sigma(k) + d(k), where sigma() = A000203(), d() = A000005().
- Composite solutions to Sigma[x+d[x]] = Sigma[x]+d[x], where Sigma[] = A000203(), d[] = A000005().A063701
Composite solutions to Sigma[x+d[x]] = Sigma[x]+d[x], where Sigma[] = A000203(), d[] = A000005().
- Composite numbers k such that phi(k + d(k)) = phi(k) + d(k), where phi() = A000010(), d() = A000005().A063702
Composite numbers k such that phi(k + d(k)) = phi(k) + d(k), where phi() = A000010(), d() = A000005().
- Cyclotomic polynomials Phi_n at x=phi, floored down (where phi = tau = (sqrt(5)+1)/2).A063703
Cyclotomic polynomials Phi_n at x=phi, floored down (where phi = tau = (sqrt(5)+1)/2).
- Cyclotomic polynomials Phi_n at x=phi divided by sqrt(5) and floored down (where phi = tau = (sqrt(5)+1)/2).A063704
Cyclotomic polynomials Phi_n at x=phi divided by sqrt(5) and floored down (where phi = tau = (sqrt(5)+1)/2).
- Cyclotomic polynomials Phi_n at x=phi, rounded to nearest integer (where phi = tau = (sqrt(5)+1)/2).A063705
Cyclotomic polynomials Phi_n at x=phi, rounded to nearest integer (where phi = tau = (sqrt(5)+1)/2).
- Cyclotomic polynomials Phi_n at x=phi, divided by sqrt(5) and rounded to nearest integer (where phi = tau = (sqrt(5)+1)/2).A063706
Cyclotomic polynomials Phi_n at x=phi, divided by sqrt(5) and rounded to nearest integer (where phi = tau = (sqrt(5)+1)/2).
- Cyclotomic polynomials Phi_n at x=phi, ceiled up (where phi = tau = (sqrt(5)+1)/2).A063707
Cyclotomic polynomials Phi_n at x=phi, ceiled up (where phi = tau = (sqrt(5)+1)/2).
- Cyclotomic polynomials Phi_n at x=phi divided by sqrt(5) and ceiled up (where phi = tau = (sqrt(5)+1)/2).A063708
Cyclotomic polynomials Phi_n at x=phi divided by sqrt(5) and ceiled up (where phi = tau = (sqrt(5)+1)/2).
- Remainder when n^n is divided by n!.A063709
Remainder when n^n is divided by n!.
- Numbers k such that phi(sigma(k)+k) = sigma(k-phi(k)), where phi is A000010 and sigma is A000203.A063710
Numbers k such that phi(sigma(k)+k) = sigma(k-phi(k)), where phi is A000010 and sigma is A000203.