Sequences
392,541 sequences
- a(n) = ( A077059(n)^2 + A077060(n)^2 )^(1/3).A077061
a(n) = ( A077059(n)^2 + A077060(n)^2 )^(1/3).
- Minimal k > n such that n^2 + k^2 is a cube for k > n, or 0 if no such k exists.A077062
Minimal k > n such that n^2 + k^2 is a cube for k > n, or 0 if no such k exists.
- Squarefree kernel of prime(n) - 1.A077063
Squarefree kernel of prime(n) - 1.
- Squarefree numbers of form prime - 1.A077064
Squarefree numbers of form prime - 1.
- Semiprimes of form prime - 1.A077065
Semiprimes of form prime - 1.
- Squarefree kernel of prime(n) + 1.A077066
Squarefree kernel of prime(n) + 1.
- Squarefree numbers of the form prime + 1.A077067
Squarefree numbers of the form prime + 1.
- Semiprimes of the form prime + 1.A077068
Semiprimes of the form prime + 1.
- Sprague-Grundy (Nim) values for octal game 4.777.A077069
Sprague-Grundy (Nim) values for octal game 4.777.
- Triangle read by rows: T(n,k) is the power of 2 in denominator of coefficients of Legendre polynomials, where n >= 0 and 0 <= k <= n.A077070
Triangle read by rows: T(n,k) is the power of 2 in denominator of coefficients of Legendre polynomials, where n >= 0 and 0 <= k <= n.
- Row sums of A077070.A077071
Row sums of A077070.
- Nonzero transfer matrix elements for strip of width n.A077072
Nonzero transfer matrix elements for strip of width n.
- a(1) = 2, a(n+1) is smallest prime factor of (2 * Product_{k=1..n} a(k)) + 1.A077073
a(1) = 2, a(n+1) is smallest prime factor of (2 * Product_{k=1..n} a(k)) + 1.
- Least k such that Z(k,3) <= Z(n,4) where Z(m,s) = Sum_{i>=m} 1/i^s.A077074
Least k such that Z(k,3) <= Z(n,4) where Z(m,s) = Sum_{i>=m} 1/i^s.
- Least k such that Z(k,4) <= Z(n,5) where Z(m,s) = Sum_{i>=m} 1/i^s.A077075
Least k such that Z(k,4) <= Z(n,5) where Z(m,s) = Sum_{i>=m} 1/i^s.
- Trajectory of 537 under the Reverse and Add! operation carried out in base 2, written in base 10.A077076
Trajectory of 537 under the Reverse and Add! operation carried out in base 2, written in base 10.
- Trajectory of 775 under the Reverse and Add! operation carried out in base 2, written in base 10.A077077
Trajectory of 775 under the Reverse and Add! operation carried out in base 2, written in base 10.
- Number of different absolute values of vector sums generated by n vectors chosen from 2n (equally spaced) points around the unit circle. Dipole moments of n positive and n negative equally spaced charges on a circle.A077078
Number of different absolute values of vector sums generated by n vectors chosen from 2n (equally spaced) points around the unit circle. Dipole moments of n positive and n negative equally spaced charges on a circle.
- Number of inequivalent bracelets from A006840 with the additional equivalence condition that subsets of 1-beads whose position vectors add to zero can be removed. Different values of vector sums of (-1)^(k/n) with k taking n values in 1..2n up to rotation and reflection.A077079
Number of inequivalent bracelets from A006840 with the additional equivalence condition that subsets of 1-beads whose position vectors add to zero can be removed. Different values of vector sums of (-1)^(k/n) with k taking n values in 1..2n up to rotation and reflection.
- a(n) = phi(sigma(n) + phi(n)) = A000010(A000203(n) + A000010(n)) = A000010(A065387(n)).A077080
a(n) = phi(sigma(n) + phi(n)) = A000010(A000203(n) + A000010(n)) = A000010(A065387(n)).
- Fixed point when phi(sigma(n)+phi(n))=A077080 is iterated with initial value of n.A077081
Fixed point when phi(sigma(n)+phi(n))=A077080 is iterated with initial value of n.
- Largest value arising when phi(sigma(n)+phi(n))=A077080 is iterated with initial value of n.A077082
Largest value arising when phi(sigma(n)+phi(n))=A077080 is iterated with initial value of n.
- Length of iteration until a fixed point is reached when phi(sigma[n]+phi(n)) = A077080(n) is iterated with initial value of n.A077083
Length of iteration until a fixed point is reached when phi(sigma[n]+phi(n)) = A077080(n) is iterated with initial value of n.
- Erroneous version of A097646.A077084
Erroneous version of A097646.
- Initial values such that if A077080(x)=phi(sigma(x)+phi(x)) is started at these numbers then the sequence does not converge.A077085
Initial values such that if A077080(x)=phi(sigma(x)+phi(x)) is started at these numbers then the sequence does not converge.
- Remainder when sigma(n+1) is divided by sigma(n).A077086
Remainder when sigma(n+1) is divided by sigma(n).
- Numbers k such that sigma(k+1) = 3 * sigma(k).A077087
Numbers k such that sigma(k+1) = 3 * sigma(k).
- a(n) = phi(sigma(n) - phi(n)), where phi is Euler's totient function and sigma is the sum of divisors function, with a(1) = 0.A077088
a(n) = phi(sigma(n) - phi(n)), where phi is Euler's totient function and sigma is the sum of divisors function, with a(1) = 0.
- Quotients when sigma(k+1)/sigma(k) is an integer.A077089
Quotients when sigma(k+1)/sigma(k) is an integer.
- When iteration of f(x) = phi(sigma(x) - phi(x)) is started at initial values listed here it ends up in a cycle of length greater than 1.A077090
When iteration of f(x) = phi(sigma(x) - phi(x)) is started at initial values listed here it ends up in a cycle of length greater than 1.
- Composites c, such that when iteration of f(k) = phi(sigma(k)-phi(k)) is started at c it ends at a fixed point > 1.A077091
Composites c, such that when iteration of f(k) = phi(sigma(k)-phi(k)) is started at c it ends at a fixed point > 1.
- Fixed points of iteration in A077091.A077092
Fixed points of iteration in A077091.
- Smallest initial values leading to fixed points listed in A077092.A077093
Smallest initial values leading to fixed points listed in A077092.
- Numbers k such that iterating phi(sigma(k)-phi(k)) starting from k leads to the fixed point 4.A077094
Numbers k such that iterating phi(sigma(k)-phi(k)) starting from k leads to the fixed point 4.
- Numbers k such that iterating phi(sigma(k)-phi(k)) starting from k leads to the fixed point 24.A077095
Numbers k such that iterating phi(sigma(k)-phi(k)) starting from k leads to the fixed point 24.
- Numbers k such that iterating phi(sigma(k)-phi(k)) starting from k leads to the fixed point 8064.A077096
Numbers k such that iterating phi(sigma(k)-phi(k)) starting from k leads to the fixed point 8064.
- Quotient cycle length in continued fraction expansion of sqrt(1+n^n).A077097
Quotient cycle length in continued fraction expansion of sqrt(1+n^n).
- Length of period of the continued fraction expansion of sqrt(-1+n^n).A077098
Length of period of the continued fraction expansion of sqrt(-1+n^n).
- a(n) = gcd(A051612(n), A065387(n)), where A051612(n) = sigma(n) - phi(n) and A065387(n) = sigma(n) + phi(n).A077099
a(n) = gcd(A051612(n), A065387(n)), where A051612(n) = sigma(n) - phi(n) and A065387(n) = sigma(n) + phi(n).
- a(n) = lcm(A051612(n), A065387(n)), where A051612(n) = sigma(n) - phi(n) and A065387(n) = sigma(n) + phi(n).A077100
a(n) = lcm(A051612(n), A065387(n)), where A051612(n) = sigma(n) - phi(n) and A065387(n) = sigma(n) + phi(n).
- a(n) = A051612(n)*A065387(n) = sigma(n)^2-phi(n)^2, where A051612(n) = sigma(n) - phi(n) and A065387(n) = sigma(n) + phi(n).A077101
a(n) = A051612(n)*A065387(n) = sigma(n)^2-phi(n)^2, where A051612(n) = sigma(n) - phi(n) and A065387(n) = sigma(n) + phi(n).
- Smallest number m such that GCD(a+b,a-b) = n, where a = sigma(m) and b = phi(m).A077102
Smallest number m such that GCD(a+b,a-b) = n, where a = sigma(m) and b = phi(m).
- Numbers n such that gcd(a,b) is not equal to gcd(a+b,a-b), where a=sigma(n)=A000203(n) and b=phi(n)=A000010(n).A077103
Numbers n such that gcd(a,b) is not equal to gcd(a+b,a-b), where a=sigma(n)=A000203(n) and b=phi(n)=A000010(n).
- Duplicate of A073815.A077104
Duplicate of A073815.
- Number of nonisomorphic generalized Petersen P(n,k) graphs on 2n nodes for 1<=k<=floor((n-1)/2).A077105
Number of nonisomorphic generalized Petersen P(n,k) graphs on 2n nodes for 1<=k<=floor((n-1)/2).
- Largest integer cube <= n^2.A077106
Largest integer cube <= n^2.
- Least integer cube >= n^2.A077107
Least integer cube >= n^2.
- Duplicate of A075847.A077108
Duplicate of A075847.
- Duplicate of A070923.A077109
Duplicate of A070923.
- Nearest integer cube to n^2.A077110
Nearest integer cube to n^2.