Sequences
392,541 sequences
- Table of bits required for product of n- and k-bit nonnegative numbers read by antidiagonals.A063711
Table of bits required for product of n- and k-bit nonnegative numbers read by antidiagonals.
- Table of bits required for product of n- and k-bit positive numbers read by antidiagonals.A063712
Table of bits required for product of n- and k-bit positive numbers read by antidiagonals.
- Numbers n such that there exist primes p, q, r with n*2 = p - r = r + q (values of r are given in A063714).A063713
Numbers n such that there exist primes p, q, r with n*2 = p - r = r + q (values of r are given in A063714).
- Values of r occurring in A063713.A063714
Values of r occurring in A063713.
- Number of solutions (r,u,s,t) in positive integers to the system of equations 1/r + 1/u = 1/n, 1/s + 1/t = 1/u.A063715
Number of solutions (r,u,s,t) in positive integers to the system of equations 1/r + 1/u = 1/n, 1/s + 1/t = 1/u.
- Number of solutions (r,u,s,t), s>=t, in positive integers to the system of equations 1/r+1/u=1/n, 1/s+1/t=1/u.A063716
Number of solutions (r,u,s,t), s>=t, in positive integers to the system of equations 1/r+1/u=1/n, 1/s+1/t=1/u.
- a(n) is the greatest divisor of n^2 that is less than n.A063717
a(n) is the greatest divisor of n^2 that is less than n.
- a(n) is the smallest divisor of n^2 that is greater than n.A063718
a(n) is the smallest divisor of n^2 that is greater than n.
- Numbers n such that usigma(cototient(n)) is a prime.A063719
Numbers n such that usigma(cototient(n)) is a prime.
- Number of segments lit in a 7-segment display (as on a calculator) to represent the number n, variant 0: '6', '7' and '9' use 5, 3 and 5 segments, respectively.A063720
Number of segments lit in a 7-segment display (as on a calculator) to represent the number n, variant 0: '6', '7' and '9' use 5, 3 and 5 segments, respectively.
- Number of proper divisors of n is a square and sets a new record for such squares.A063721
Number of proper divisors of n is a square and sets a new record for such squares.
- Number of edges in the Platonic solids (in the order tetrahedron, cube, octahedron, dodecahedron, icosahedron).A063722
Number of edges in the Platonic solids (in the order tetrahedron, cube, octahedron, dodecahedron, icosahedron).
- Number of vertices in the Platonic solids (in the order tetrahedron, cube, octahedron, dodecahedron, icosahedron).A063723
Number of vertices in the Platonic solids (in the order tetrahedron, cube, octahedron, dodecahedron, icosahedron).
- Consider problem of placing N queens on an n X n board so that each queen attacks precisely 4 others. Sequence gives maximal number of queens.A063724
Consider problem of placing N queens on an n X n board so that each queen attacks precisely 4 others. Sequence gives maximal number of queens.
- Number of ordered pairs (x,y) of positive integers such that x^2 + y^2 = n.A063725
Number of ordered pairs (x,y) of positive integers such that x^2 + y^2 = n.
- a(n) = gcd(1 + Fibonacci(n+1), 1 + Fibonacci(n)).A063726
a(n) = gcd(1 + Fibonacci(n+1), 1 + Fibonacci(n)).
- a(n) = 2*a(n-1) + 4*a(n-2), a(0)=1, a(1)=2.A063727
a(n) = 2*a(n-1) + 4*a(n-2), a(0)=1, a(1)=2.
- a(n) = shift(a(n-1); a(n-3)), a(0)=2, a(1)=3.A063728
a(n) = shift(a(n-1); a(n-3)), a(0)=2, a(1)=3.
- Numbers k such that sigma(k)+1 is a square and sets a new record for such squares.A063729
Numbers k such that sigma(k)+1 is a square and sets a new record for such squares.
- Number of solutions to w^2 + x^2 + y^2 + z^2 = n in positive integers.A063730
Number of solutions to w^2 + x^2 + y^2 + z^2 = n in positive integers.
- Numbers k such that Sum_{j=1..k} sigma(j) divides Product_{j=1..k} sigma(j).A063731
Numbers k such that Sum_{j=1..k} sigma(j) divides Product_{j=1..k} sigma(j).
- Numbers whose Lucas representation excludes L_0 = 2.A063732
Numbers whose Lucas representation excludes L_0 = 2.
- A variant of Recamán's sequence: a(0)=1, a(n) = a(n-1)-(n-1) if positive and new, else a(n) = a(n-1)+(n-1).A063733
A variant of Recamán's sequence: a(0)=1, a(n) = a(n-1)-(n-1) if positive and new, else a(n) = a(n-1)+(n-1).
- Square abundant numbers.A063734
Square abundant numbers.
- Square deficient numbers.A063735
Square deficient numbers.
- To get a(n), the pattern of the possible squarefree triple (4n+1, 4n+2, 4n+3) is coded as follows: compute A008966(x) getting one of {000, 001, 010, 011, 100, 101, 110, 111} and convert from binary.A063736
To get a(n), the pattern of the possible squarefree triple (4n+1, 4n+2, 4n+3) is coded as follows: compute A008966(x) getting one of {000, 001, 010, 011, 100, 101, 110, 111} and convert from binary.
- Numbers n such that sum of digits of n is equal to the sum of the prime factors of n, counted with multiplicity.A063737
Numbers n such that sum of digits of n is equal to the sum of the prime factors of n, counted with multiplicity.
- Numbers n such that sum of digits of n is equal to the product of the digits of the sum of the prime factors of n, counted with multiplicity.A063738
Numbers n such that sum of digits of n is equal to the product of the digits of the sum of the prime factors of n, counted with multiplicity.
- Squarefree numbers k such that phi(k) = phi(k+1).A063739
Squarefree numbers k such that phi(k) = phi(k+1).
- Number of integers k such that cototient(k) = n.A063740
Number of integers k such that cototient(k) = n.
- Smallest number whose inverse cototient set has n elements.A063741
Smallest number whose inverse cototient set has n elements.
- Cototients: numbers k such that x - phi(x) = k has at least one solution.A063742
Cototients: numbers k such that x - phi(x) = k has at least one solution.
- Numbers n such that n and Omega(n) are relatively prime, where Omega(n) is the number of prime divisors of n (with repetition).A063743
Numbers n such that n and Omega(n) are relatively prime, where Omega(n) is the number of prime divisors of n (with repetition).
- a(n) = sigma(a(n-1)) * number of divisors of a(n-1), a(1)=2.A063744
a(n) = sigma(a(n-1)) * number of divisors of a(n-1), a(1)=2.
- Even numbers with an even number of prime factors (counted with multiplicity).A063745
Even numbers with an even number of prime factors (counted with multiplicity).
- Triangle read by rows giving number of partitions of k (k=0 .. n^2) with Ferrers plot fitting in an n X n box.A063746
Triangle read by rows giving number of partitions of k (k=0 .. n^2) with Ferrers plot fitting in an n X n box.
- Sign of n-th coefficient of power series for 1/Gamma(1-x) where Gamma is the Gamma function.A063747
Sign of n-th coefficient of power series for 1/Gamma(1-x) where Gamma is the Gamma function.
- Greatest x that is a solution to x-phi(x)=n or zero if there is no solution, where phi(x) is Euler's totient function.A063748
Greatest x that is a solution to x-phi(x)=n or zero if there is no solution, where phi(x) is Euler's totient function.
- a(n) = floor(d(n)*(n+1)/2) - sigma(n), where d = A000005, sigma = A000203.A063749
a(n) = floor(d(n)*(n+1)/2) - sigma(n), where d = A000005, sigma = A000203.
- Number of divisors (A000005) of the Wonderful Demlo numbers A002477.A063750
Number of divisors (A000005) of the Wonderful Demlo numbers A002477.
- a(n) = phi(A002477(n)).A063751
a(n) = phi(A002477(n)).
- Numbers k such that cototient(k) is a square.A063752
Numbers k such that cototient(k) is a square.
- Numbers k such that cototient(k) is a square and sets a new record for squares.A063753
Numbers k such that cototient(k) is a square and sets a new record for squares.
- Dirichlet convolution of totient and cototient.A063754
Dirichlet convolution of totient and cototient.
- Squares k which are divisible by phi(k).A063755
Squares k which are divisible by phi(k).
- Number of groups of order <= n.A063756
Number of groups of order <= n.
- G.f.: (1+3*x+2*x^2)/((1-x)*(1-2*x^2)).A063757
G.f.: (1+3*x+2*x^2)/((1-x)*(1-2*x^2)).
- a(0)=1, a(n) = 2*Fibonacci(n+4) - 6.A063758
a(0)=1, a(n) = 2*Fibonacci(n+4) - 6.
- Spherical growth series for modular group.A063759
Spherical growth series for modular group.
- Numbers whose sum of non-unitary divisors is a prime and sets a new record for such primes.A063760
Numbers whose sum of non-unitary divisors is a prime and sets a new record for such primes.