Sequences
392,541 sequences
- a(n) = Card{ k<=n | bigomega(k) != bigomega(n) }.A070961
a(n) = Card{ k<=n | bigomega(k) != bigomega(n) }.
- a(n) = Card{ k<=n | omega(k)!=omega(n) }, where omega(n) = A001221(n).A070962
a(n) = Card{ k<=n | omega(k)!=omega(n) }, where omega(n) = A001221(n).
- a(1) = 2; for n >= 2, n = Sum_{1<=k<n, gcd(k,n)=1} a(k).A070963
a(1) = 2; for n >= 2, n = Sum_{1<=k<n, gcd(k,n)=1} a(k).
- a(n) = Sum_{1<=k<=n, gcd(k,n)=1} Fibonacci(k).A070964
a(n) = Sum_{1<=k<=n, gcd(k,n)=1} Fibonacci(k).
- a(1) = 1; a(n+1) = sum{k|n} a(k) * mu(k), where the sum is over the positive divisors, k, of n; and mu(k) is the Moebius function.A070965
a(1) = 1; a(n+1) = sum{k|n} a(k) * mu(k), where the sum is over the positive divisors, k, of n; and mu(k) is the Moebius function.
- a(n) = Sum_{k|n, k<=sqrt(n)} phi(k); where the sum is over the positive divisors, k, of n, which are <= the square root of n; and phi(k) is the Euler totient function.A070966
a(n) = Sum_{k|n, k<=sqrt(n)} phi(k); where the sum is over the positive divisors, k, of n, which are <= the square root of n; and phi(k) is the Euler totient function.
- a(n) = Sum_{k=0..n} binomial(6*n,6*k).A070967
a(n) = Sum_{k=0..n} binomial(6*n,6*k).
- Number of cycles in the complete bipartite graph K(n,n).A070968
Number of cycles in the complete bipartite graph K(n,n).
- a(n) = 2^(2^n + 1) + 1.A070969
a(n) = 2^(2^n + 1) + 1.
- Smallest number k such that A065422(k)/A065422(k+1) = k^n, where k>1.A070970
Smallest number k such that A065422(k)/A065422(k+1) = k^n, where k>1.
- a(n) is the smallest positive integer m for which A070194(m) (i.e., the maximal gap in {k|gcd(k,m) = 1, 1 <= k <= m-1}) is n.A070971
a(n) is the smallest positive integer m for which A070194(m) (i.e., the maximal gap in {k|gcd(k,m) = 1, 1 <= k <= m-1}) is n.
- Length of longest run of consecutive 1's in binary expansion of 3^n (A004656).A070972
Length of longest run of consecutive 1's in binary expansion of 3^n (A004656).
- Smallest integer k such that n divides floor((3/2)^k).A070973
Smallest integer k such that n divides floor((3/2)^k).
- Number of steps to reach 1 in `3x+1' (or Collatz) problem starting with n!.A070974
Number of steps to reach 1 in `3x+1' (or Collatz) problem starting with n!.
- Number of steps to reach 1 in `3x+1' (or Collatz) problem starting with prime(n).A070975
Number of steps to reach 1 in `3x+1' (or Collatz) problem starting with prime(n).
- Number of steps to reach 1 in '3x+1' (or Collatz) problem starting with 3^n.A070976
Number of steps to reach 1 in '3x+1' (or Collatz) problem starting with 3^n.
- Smallest k such that zeta(3)-sum(i=1,k,1/i^3) <= zeta(4)-sum(i=1,n,1/i^4).A070977
Smallest k such that zeta(3)-sum(i=1,k,1/i^3) <= zeta(4)-sum(i=1,n,1/i^4).
- Smallest k such that zeta(4)-sum(i=1,k,1/i^4) <= zeta(5)-sum(i=1,n,1/i^5).A070978
Smallest k such that zeta(4)-sum(i=1,k,1/i^4) <= zeta(5)-sum(i=1,n,1/i^5).
- Triangle read by rows giving size of minimal asymmetric covering code of length n and radius R.A070979
Triangle read by rows giving size of minimal asymmetric covering code of length n and radius R.
- Numbers k such that the number of steps to reach 1 in '3x+1' problem equals tau(k), the number of divisors of k.A070980
Numbers k such that the number of steps to reach 1 in '3x+1' problem equals tau(k), the number of divisors of k.
- Smallest integer k such that n divides floor((4/3)^k).A070981
Smallest integer k such that n divides floor((4/3)^k).
- Smallest integer k such that n divides sigma(k).A070982
Smallest integer k such that n divides sigma(k).
- Erroneous version of A078350.A070983
Erroneous version of A078350.
- a(n) = k such that (k-1)*log(k-1) < n < k*log(k).A070984
a(n) = k such that (k-1)*log(k-1) < n < k*log(k).
- Number of terms in the simple continued fraction for Sum_{k=1..n} 1/k^2.A070985
Number of terms in the simple continued fraction for Sum_{k=1..n} 1/k^2.
- Number of terms in the simple continued fraction for Sum_{k=1..n} 1/k^3.A070986
Number of terms in the simple continued fraction for Sum_{k=1..n} 1/k^3.
- Number of terms in simple continued fraction for sum(k=1,n,1/k^4).A070987
Number of terms in simple continued fraction for sum(k=1,n,1/k^4).
- Continued fraction for Pi/3.A070988
Continued fraction for Pi/3.
- Continued fraction for Pi/4.A070989
Continued fraction for Pi/4.
- First differences of A002487.A070990
First differences of A002487.
- Numbers n such that the trajectory of n under the `3x+1' map reaches n - 1.A070991
Numbers n such that the trajectory of n under the `3x+1' map reaches n - 1.
- Partial sums of A002487.A070992
Partial sums of A002487.
- Numbers n such that the trajectory of n under the "3x+1" map reaches n+1.A070993
Numbers n such that the trajectory of n under the "3x+1" map reaches n+1.
- Numbers k such that the trajectory of k under the 3x+1 map reaches phi(k).A070994
Numbers k such that the trajectory of k under the 3x+1 map reaches phi(k).
- Number of nonisomorphic (undirected) Cayley graphs for the group Zp x Zp, where Zp is the elementary Abelian group of order p and p is prime. The sequence is index by primes, though starts with 1.A070995
Number of nonisomorphic (undirected) Cayley graphs for the group Zp x Zp, where Zp is the elementary Abelian group of order p and p is prime. The sequence is index by primes, though starts with 1.
- Numbers n whose sum of divisors and number of divisors are both triangular numbers.A070996
Numbers n whose sum of divisors and number of divisors are both triangular numbers.
- a(n) = 8*a(n-1) - a(n-2), a(0)=1, a(-1)=1.A070997
a(n) = 8*a(n-1) - a(n-2), a(0)=1, a(-1)=1.
- a(n) = 9*a(n-1) - a(n-2) for n > 0, a(0)=1, a(-1)=1.A070998
a(n) = 9*a(n-1) - a(n-2) for n > 0, a(0)=1, a(-1)=1.
- Numbers n such that the denominator of Sum_{k=1..n} 1/gcd(n,k) is not equal to n.A070999
Numbers n such that the denominator of Sum_{k=1..n} 1/gcd(n,k) is not equal to n.
- Numbers m such that the denominator of Sum_{k=1..m} 1/gcd(m,k) equals m.A071000
Numbers m such that the denominator of Sum_{k=1..m} 1/gcd(m,k) equals m.
- Binary expansion of Gamma(3/4).A071001
Binary expansion of Gamma(3/4).
- Binary expansion of Gamma(1/4).A071002
Binary expansion of Gamma(1/4).
- Binary expansion of Gamma(5/4).A071003
Binary expansion of Gamma(5/4).
- Binary expansion of AGM(1,sqrt(2)) where AGM(x,y) denote the arithmetic-geometric mean of (x,y).A071004
Binary expansion of AGM(1,sqrt(2)) where AGM(x,y) denote the arithmetic-geometric mean of (x,y).
- Binary expansion of Pi/3 (A019670).A071005
Binary expansion of Pi/3 (A019670).
- Number of positive solutions to the Diophantine equation x^2+y^3=n^2 with y <= x.A071006
Number of positive solutions to the Diophantine equation x^2+y^3=n^2 with y <= x.
- Number of permutations in the symmetric group S_n such that the maximal cycle has length exactly 3.A071007
Number of permutations in the symmetric group S_n such that the maximal cycle has length exactly 3.
- Numbers n such that uphi(uphi(n)) = n/2.A071008
Numbers n such that uphi(uphi(n)) = n/2.
- Number of solutions (x,y,z,u,v,w) to x+y+z = u+v+w, 0<=x,y,z,u,v,w<=n-1, x>=y>=z, u>=v>=w.A071009
Number of solutions (x,y,z,u,v,w) to x+y+z = u+v+w, 0<=x,y,z,u,v,w<=n-1, x>=y>=z, u>=v>=w.
- Sigma(k)/4 when k is not a sum of 2 squares.A071010
Sigma(k)/4 when k is not a sum of 2 squares.