Sequences
392,541 sequences
- Values of floor((4/3)^n) that are composite.A070761
Values of floor((4/3)^n) that are composite.
- n for which floor((4/3)^n) is prime.A070762
n for which floor((4/3)^n) is prime.
- Numbers n such that sigma(n) is a power of prime (of the form p^a, p prime, a>=1).A070763
Numbers n such that sigma(n) is a power of prime (of the form p^a, p prime, a>=1).
- Number of polyiamonds with n cells, with holes.A070764
Number of polyiamonds with n cells, with holes.
- Number of polyiamonds with n cells, without holes.A070765
Number of polyiamonds with n cells, without holes.
- Number of polyhexes with n cells that tile the plane.A070766
Number of polyhexes with n cells that tile the plane.
- Number of polyhexes with n cells that do not tile the plane.A070767
Number of polyhexes with n cells that do not tile the plane.
- Number of polyhexes with n cells without holes that do not tile the plane.A070768
Number of polyhexes with n cells without holes that do not tile the plane.
- Decimal expansion of Soldner's constant.A070769
Decimal expansion of Soldner's constant.
- b + c + d where b >= c >= d >= 0 ordered by b then c then d.A070770
b + c + d where b >= c >= d >= 0 ordered by b then c then d.
- b+c+d+e where b>=c>=d>=e>=0 ordered by b then c then d then e.A070771
b+c+d+e where b>=c>=d>=e>=0 ordered by b then c then d then e.
- b+c+d+e+f where b>=c>=d>=e>=f>=0 ordered by b then c then d then e then f.A070772
b+c+d+e+f where b>=c>=d>=e>=f>=0 ordered by b then c then d then e then f.
- Number of solutions to p(2m)-2p(m)=2n-1, where p(m) = m-th prime.A070773
Number of solutions to p(2m)-2p(m)=2n-1, where p(m) = m-th prime.
- Odd numbers n such that p(2m)-2p(m)=n has no solution (p(m) = m-th prime).A070774
Odd numbers n such that p(2m)-2p(m)=n has no solution (p(m) = m-th prime).
- a(n) = Sum_{k=0..n} binomial(4*n,4*k).A070775
a(n) = Sum_{k=0..n} binomial(4*n,4*k).
- Numbers k such that number of terms in the k-th cyclotomic polynomial is equal to the largest prime factor of k.A070776
Numbers k such that number of terms in the k-th cyclotomic polynomial is equal to the largest prime factor of k.
- a(1) = 1; a(n) = (largest prime factor of n) - 1.A070777
a(1) = 1; a(n) = (largest prime factor of n) - 1.
- Let M denote the 6 X 6 matrix = row by row /1,1,1,1,1,1/1,1,1,1,1,0/1,1,1,1,0,0/1,1,1,0,0,0/1,1,0,0,0,0/1,0,0,0,0,0/ and A(n) the vector (x(n),y(n),z(n),t(n),u(n),v(n)) = M^n*A where A is the vector (1,1,1,1,1,1); then a(n) = u(n).A070778
Let M denote the 6 X 6 matrix = row by row /1,1,1,1,1,1/1,1,1,1,1,0/1,1,1,1,0,0/1,1,1,0,0,0/1,1,0,0,0,0/1,0,0,0,0,0/ and A(n) the vector (x(n),y(n),z(n),t(n),u(n),v(n)) = M^n*A where A is the vector (1,1,1,1,1,1); then a(n) = u(n).
- Expansion of e.g.f.: (exp(x/(1-x))*(2-x)-1+x)/(1-x)^3.A070779
Expansion of e.g.f.: (exp(x/(1-x))*(2-x)-1+x)/(1-x)^3.
- a(n) = binomial((n+1)^2,n).A070780
a(n) = binomial((n+1)^2,n).
- a(n) = binomial((n+1)^2, n^2).A070781
a(n) = binomial((n+1)^2, n^2).
- a(n) = Sum_{k=0..n} binomial(5*n,5*k).A070782
a(n) = Sum_{k=0..n} binomial(5*n,5*k).
- Square of longest side of triangles with sides whose squares are integers and with positive integer area, ordered by longest side, then second longest side and finally shortest side.A070783
Square of longest side of triangles with sides whose squares are integers and with positive integer area, ordered by longest side, then second longest side and finally shortest side.
- Square of second longest side of triangles with sides whose squares are integers and with positive integer area, ordered by longest side, then second longest side and finally shortest side.A070784
Square of second longest side of triangles with sides whose squares are integers and with positive integer area, ordered by longest side, then second longest side and finally shortest side.
- Square of shortest side of triangles with sides whose squares are integers and with positive integer area, ordered by longest side, then second longest side and finally shortest side.A070785
Square of shortest side of triangles with sides whose squares are integers and with positive integer area, ordered by longest side, then second longest side and finally shortest side.
- Area of triangles with sides whose squares are integers and with positive integer area, ordered by longest side, then second longest side and finally shortest side.A070786
Area of triangles with sides whose squares are integers and with positive integer area, ordered by longest side, then second longest side and finally shortest side.
- Number of triangles with sides whose squares are integers and with positive integer area and longest side of length sqrt(n).A070787
Number of triangles with sides whose squares are integers and with positive integer area and longest side of length sqrt(n).
- Positive integers n such that the Reverse and Add! trajectory of n (presumably) does not join the trajectory of any m < n.A070788
Positive integers n such that the Reverse and Add! trajectory of n (presumably) does not join the trajectory of any m < n.
- Integers n such that the 'Reverse and Add!' trajectory of n joins the trajectory of 1.A070789
Integers n such that the 'Reverse and Add!' trajectory of n joins the trajectory of 1.
- Integers n such that the 'Reverse and Add!' trajectory of n joins the trajectory of 3.A070790
Integers n such that the 'Reverse and Add!' trajectory of n joins the trajectory of 3.
- Integers n such that the 'Reverse and Add!' trajectory of n joins the trajectory of 5.A070791
Integers n such that the 'Reverse and Add!' trajectory of n joins the trajectory of 5.
- Integers n such that the 'Reverse and Add!' trajectory of n joins the trajectory of 7.A070792
Integers n such that the 'Reverse and Add!' trajectory of n joins the trajectory of 7.
- Integers n such that the 'Reverse and Add!' trajectory of n joins the trajectory of 9.A070793
Integers n such that the 'Reverse and Add!' trajectory of n joins the trajectory of 9.
- Integers n such that the 'Reverse and Add!' trajectory of n joins the trajectory of 100.A070794
Integers n such that the 'Reverse and Add!' trajectory of n joins the trajectory of 100.
- Integers n such that the 'Reverse and Add!' trajectory of n joins the trajectory of 102.A070795
Integers n such that the 'Reverse and Add!' trajectory of n joins the trajectory of 102.
- Integers n such that the 'Reverse and Add!' trajectory of n joins the trajectory of 106.A070796
Integers n such that the 'Reverse and Add!' trajectory of n joins the trajectory of 106.
- Integers n such that the 'Reverse and Add!' trajectory of n joins the trajectory of 108.A070797
Integers n such that the 'Reverse and Add!' trajectory of n joins the trajectory of 108.
- Integers n such that the 'Reverse and Add!' trajectory of n joins the trajectory of 111.A070798
Integers n such that the 'Reverse and Add!' trajectory of n joins the trajectory of 111.
- Numbers of the form 6jk-j-k.A070799
Numbers of the form 6jk-j-k.
- Smallest prime greater than phi(n): a(n) = nextprime(phi(n)).A070800
Smallest prime greater than phi(n): a(n) = nextprime(phi(n)).
- Largest prime <= sigma(n): a(n) = prevprime(sigma(n)), where prevprime(n) = A007917(n), the largest prime less than or equal to n.A070801
Largest prime <= sigma(n): a(n) = prevprime(sigma(n)), where prevprime(n) = A007917(n), the largest prime less than or equal to n.
- a(n)=prevprime[sigma(n)]-nextprime[phi(n)]=A070801(n)-A070800(n).A070802
a(n)=prevprime[sigma(n)]-nextprime[phi(n)]=A070801(n)-A070800(n).
- Number of primes not exceeding sum of divisors of n.A070803
Number of primes not exceeding sum of divisors of n.
- Number of primes not exceeding phi(n).A070804
Number of primes not exceeding phi(n).
- a(1) = 2; a(n) = largest prime not exceeding the sum of all previous terms.A070805
a(1) = 2; a(n) = largest prime not exceeding the sum of all previous terms.
- Primes p such that cototient(totient(p)) = A070556(p) is a power of 2.A070806
Primes p such that cototient(totient(p)) = A070556(p) is a power of 2.
- Composite numbers n such that Cototient(totient(n))=A070556(n) is power of 2.A070807
Composite numbers n such that Cototient(totient(n))=A070556(n) is power of 2.
- Sum(((-1)^k*binomial(4*n,k)),k=n..2*n).A070808
Sum(((-1)^k*binomial(4*n,k)),k=n..2*n).
- Cototient(totient(n))=A070556(n) is not a power of 2 and n is not a prime number.A070809
Cototient(totient(n))=A070556(n) is not a power of 2 and n is not a prime number.
- Nonprime numbers k such that phi(k-phi(k)) = A054571(k) is a power of 2.A070810
Nonprime numbers k such that phi(k-phi(k)) = A054571(k) is a power of 2.