Sequences
392,541 sequences
- [t], 1+[t], [2t], 2+[2t], [3t], 3+[3t], ..., where t=tau = (1+sqrt(5))/2 and []=floor.A072061
[t], 1+[t], [2t], 2+[2t], [3t], 3+[3t], ..., where t=tau = (1+sqrt(5))/2 and []=floor.
- Inverse permutation to A072061.A072062
Inverse permutation to A072061.
- Smallest prime of form prime(n)+k*n, k>0.A072063
Smallest prime of form prime(n)+k*n, k>0.
- Least k>0 such that prime(n)+k*n is prime.A072064
Least k>0 such that prime(n)+k*n is prime.
- Define a "piece" to consist of 3 mutually touching pennies welded together to form a triangle; sequence gives side lengths of triangles that can be made from such pieces.A072065
Define a "piece" to consist of 3 mutually touching pennies welded together to form a triangle; sequence gives side lengths of triangles that can be made from such pieces.
- Exceptional (or extraordinary) numbers: m such that A005179(m) < A037019(m).A072066
Exceptional (or extraordinary) numbers: m such that A005179(m) < A037019(m).
- Duplicate of A072049.A072067
Duplicate of A072049.
- Number of integer solutions to the equation 2x^2+y^2+8z^2=m for an odd number m=2n-1.A072068
Number of integer solutions to the equation 2x^2+y^2+8z^2=m for an odd number m=2n-1.
- Number of integer solutions to the equation 2x^2+y^2+32z^2=m for an odd number m=2n-1.A072069
Number of integer solutions to the equation 2x^2+y^2+32z^2=m for an odd number m=2n-1.
- Number of integer solutions to the equation 4*x^2 + y^2 + 8*z^2 = n.A072070
Number of integer solutions to the equation 4*x^2 + y^2 + 8*z^2 = n.
- Number of integer solutions to the equation 4x^2+y^2+32z^2=n.A072071
Number of integer solutions to the equation 4x^2+y^2+32z^2=n.
- Least number initiating a chain of n consecutive numbers each of which has maximal prime exponent exactly 3.A072072
Least number initiating a chain of n consecutive numbers each of which has maximal prime exponent exactly 3.
- Number of solutions to cototient(x) = A051953(x) = 2^n.A072073
Number of solutions to cototient(x) = A051953(x) = 2^n.
- Number of integers k such that phi(k) = 10^n.A072074
Number of integers k such that phi(k) = 10^n.
- Smallest solution to phi(x) = 10^n where phi(x) = A000010(x).A072075
Smallest solution to phi(x) = 10^n where phi(x) = A000010(x).
- Largest k such that EulerPhi(k) = 10^n.A072076
Largest k such that EulerPhi(k) = 10^n.
- Number of even nontotients not exceeding 2^n.A072077
Number of even nontotients not exceeding 2^n.
- Number of 3-smooth divisors of n.A072078
Number of 3-smooth divisors of n.
- Sum of 3-smooth divisors of n.A072079
Sum of 3-smooth divisors of n.
- Number of (nontrivial) zeros of zeta(z) with 0 < Im(z) < 10^n.A072080
Number of (nontrivial) zeros of zeta(z) with 0 < Im(z) < 10^n.
- Numbers divisible by the square of the sum of their digits in base 10.A072081
Numbers divisible by the square of the sum of their digits in base 10.
- Numbers divisible by the cube of the sum of their digits in base 10.A072082
Numbers divisible by the cube of the sum of their digits in base 10.
- Numbers divisible by the 4th power of the sum of their digits in base 10.A072083
Numbers divisible by the 4th power of the sum of their digits in base 10.
- In prime factorization of n replace all primes with their numbers of 1's in binary representation.A072084
In prime factorization of n replace all primes with their numbers of 1's in binary representation.
- a(n) = A072084(A072084(n)).A072085
a(n) = A072084(A072084(n)).
- Number of steps to reach 1, starting with n and applying the A072084-map repeatedly.A072086
Number of steps to reach 1, starting with n and applying the A072084-map repeatedly.
- Least k such that A072084(k) = n.A072087
Least k such that A072084(k) = n.
- Permutation of natural numbers induced by the automorphism gt-bf->df (switch from the Breadth First to the Depth First coding for the general trees/parenthesizations) acting on the parenthesizations encoded by A014486.A072088
Permutation of natural numbers induced by the automorphism gt-bf->df (switch from the Breadth First to the Depth First coding for the general trees/parenthesizations) acting on the parenthesizations encoded by A014486.
- Permutation of natural numbers induced by the automorphism gt-df->bf (switch from the Depth First to the Breadth First coding for the general trees/parenthesizations) acting on the parenthesizations encoded by A014486.A072089
Permutation of natural numbers induced by the automorphism gt-df->bf (switch from the Depth First to the Breadth First coding for the general trees/parenthesizations) acting on the parenthesizations encoded by A014486.
- Permutation of natural numbers induced by the automorphism cdr_robr_car! acting on the parenthesizations encoded by A014486.A072090
Permutation of natural numbers induced by the automorphism cdr_robr_car! acting on the parenthesizations encoded by A014486.
- Permutation of natural numbers induced by the automorphism car_robl_cdr! acting on the parenthesizations encoded by A014486.A072091
Permutation of natural numbers induced by the automorphism car_robl_cdr! acting on the parenthesizations encoded by A014486.
- Permutation of natural numbers induced by the automorphism car_robr_car! acting on the parenthesizations encoded by A014486.A072092
Permutation of natural numbers induced by the automorphism car_robr_car! acting on the parenthesizations encoded by A014486.
- Permutation of natural numbers induced by the automorphism car_robl_car! acting on the parenthesizations encoded by A014486.A072093
Permutation of natural numbers induced by the automorphism car_robl_car! acting on the parenthesizations encoded by A014486.
- Permutation of natural numbers induced by the automorphism cdr_robr_cdr! acting on the parenthesizations encoded by A014486.A072094
Permutation of natural numbers induced by the automorphism cdr_robr_cdr! acting on the parenthesizations encoded by A014486.
- Permutation of natural numbers induced by the automorphism cdr_robl_cdr! acting on the parenthesizations encoded by A014486.A072095
Permutation of natural numbers induced by the automorphism cdr_robl_cdr! acting on the parenthesizations encoded by A014486.
- Energetic numbers, allowing zero as an exponent.A072096
Energetic numbers, allowing zero as an exponent.
- Decimal expansion of 180/Pi.A072097
Decimal expansion of 180/Pi.
- Numbers k such that the difference between 10^k and the next prime > 10^k is a record high.A072098
Numbers k such that the difference between 10^k and the next prime > 10^k is a record high.
- First term = 1 and, for each n > 1, n*a(n) does not appear.A072099
First term = 1 and, for each n > 1, n*a(n) does not appear.
- Column 2 of the array m(i,1)=m(1,j)=1 m(i,j)=m(i-1,j-1)+m(i-1,j+1) (a(n)=m(n,2)).A072100
Column 2 of the array m(i,1)=m(1,j)=1 m(i,j)=m(i-1,j-1)+m(i-1,j+1) (a(n)=m(n,2)).
- Continued fraction expansion of Product_{p prime} (1 - 1/(p^2-1)).A072101
Continued fraction expansion of Product_{p prime} (1 - 1/(p^2-1)).
- Decimal expansion of sum of reciprocal perfect powers (excluding 1).A072102
Decimal expansion of sum of reciprocal perfect powers (excluding 1).
- Sorted perfect powers a^b for a, b > 1 with duplication.A072103
Sorted perfect powers a^b for a, b > 1 with duplication.
- Smallest absolute value of discriminant of a real (not necessarily totally real) algebraic number field of degree n.A072104
Smallest absolute value of discriminant of a real (not necessarily totally real) algebraic number field of degree n.
- Let c(1)=x, c(n+1) = c(n)/2 + n if c(n) is even, c(n+1)= 2c(n) - n otherwise; then a(n)=c(n) for c(1)=3.A072105
Let c(1)=x, c(n+1) = c(n)/2 + n if c(n) is even, c(n+1)= 2c(n) - n otherwise; then a(n)=c(n) for c(1)=3.
- The number of nontotients (even and odd) in the reduced residue system of n.A072106
The number of nontotients (even and odd) in the reduced residue system of n.
- a(n) = Sum_{k=1..n} A014963(k).A072107
a(n) = Sum_{k=1..n} A014963(k).
- Least k such that Sum_{i=1..k} gcd(k,i) = n * sigma(k).A072108
Least k such that Sum_{i=1..k} gcd(k,i) = n * sigma(k).
- Numbers k such that Sum_{i=1..k} gcd(k,i) divides Sum_{i=1..k} lcm(k,i).A072109
Numbers k such that Sum_{i=1..k} gcd(k,i) divides Sum_{i=1..k} lcm(k,i).
- a(n) = 4*a(n-1) - a(n-2) - 2, with a(0)=1, a(1)=2.A072110
a(n) = 4*a(n-1) - a(n-2) - 2, with a(0)=1, a(1)=2.