Sequences
392,541 sequences
- Sum of primes < n that do not divide n.A066911
Sum of primes < n that do not divide n.
- Fourth column of the Eulerian triangle A008292 in square array format.A066912
Fourth column of the Eulerian triangle A008292 in square array format.
- (sum of primes < n that do not divide n) (mod n).A066913
(sum of primes < n that do not divide n) (mod n).
- Integers of the form (2^(n^3)+1)/(2^(n^2)+1).A066914
Integers of the form (2^(n^3)+1)/(2^(n^2)+1).
- a(n) = n^phi(n) + 1.A066915
a(n) = n^phi(n) + 1.
- a(n) = n^phi(n) - 1.A066916
a(n) = n^phi(n) - 1.
- Determinant of n X n matrix whose rows are cyclic permutations of 4..Composite(n).A066917
Determinant of n X n matrix whose rows are cyclic permutations of 4..Composite(n).
- a(n) = least natural number k such that f(k) begins a maximal zigzag of length n in the prime gaps function f(x) = p(x+1)-p(x), where p(x) denotes the x-th prime. (Cf. A066485.)A066918
a(n) = least natural number k such that f(k) begins a maximal zigzag of length n in the prime gaps function f(x) = p(x+1)-p(x), where p(x) denotes the x-th prime. (Cf. A066485.)
- a(n) = least number of applications of f to n to reach 1, where f is defined by f(n) = phi(n) if n is even; = sigma(n) if n is odd.A066919
a(n) = least number of applications of f to n to reach 1, where f is defined by f(n) = phi(n) if n is even; = sigma(n) if n is odd.
- Number of partitions of n into lucky parts.A066920
Number of partitions of n into lucky parts.
- a(n) = lcm(Omega(n), omega(n)).A066921
a(n) = lcm(Omega(n), omega(n)).
- a(n) = gcd(Omega(n), omega(n)).A066922
a(n) = gcd(Omega(n), omega(n)).
- Let f(x) = phi(x) + sigma(x); a(n) = least k such that at k begins a maximal run of length n of consecutive strict local extrema of f, or 0 if no such k exists.A066923
Let f(x) = phi(x) + sigma(x); a(n) = least k such that at k begins a maximal run of length n of consecutive strict local extrema of f, or 0 if no such k exists.
- Nonprime numbers n such that the GCD of n and the Chowla's function of n (A048050) is >= n/3.A066924
Nonprime numbers n such that the GCD of n and the Chowla's function of n (A048050) is >= n/3.
- Numbers k having a partition k = sum x_i for which sum k/x_i is the same partition of k.A066925
Numbers k having a partition k = sum x_i for which sum k/x_i is the same partition of k.
- Numbers k having a partition k = sum x_i for which sum k/x_i is also a partition of k.A066926
Numbers k having a partition k = sum x_i for which sum k/x_i is also a partition of k.
- Least k such that between p and 2p, for all primes > 3, there is always a number that is twice a square, i.e.; a k such that p < 2k^2 < 2p.A066927
Least k such that between p and 2p, for all primes > 3, there is always a number that is twice a square, i.e.; a k such that p < 2k^2 < 2p.
- Numbers k such that floor(k*log(k)) is prime.A066928
Numbers k such that floor(k*log(k)) is prime.
- Numbers n such that Omega(n) = floor(log(n)).A066929
Numbers n such that Omega(n) = floor(log(n)).
- Numbers k such that phi(sigma(k)) divides sigma(phi(k)).A066930
Numbers k such that phi(sigma(k)) divides sigma(phi(k)).
- Number of ways to tile hexagon of edge n with diamonds of side 1, not counting rotations and reflections as different.A066931
Number of ways to tile hexagon of edge n with diamonds of side 1, not counting rotations and reflections as different.
- a(n) is the denominator of b(n) where b(n)=1/b(n-1)+1/b(n-2) with b(1)=1 and b(2)=2.A066932
a(n) is the denominator of b(n) where b(n)=1/b(n-1)+1/b(n-2) with b(1)=1 and b(2)=2.
- Determinant of n X n matrix whose rows are cyclic permutations of 2..prime(n).A066933
Determinant of n X n matrix whose rows are cyclic permutations of 2..prime(n).
- Numbers k such that phi(k)==1 (mod bigomega(k)) where phi(n)=A000010(n) is the Euler totient function and bigomega(n)=A001222(n) is the number of prime divisors of n (counted with multiplicity).A066934
Numbers k such that phi(k)==1 (mod bigomega(k)) where phi(n)=A000010(n) is the Euler totient function and bigomega(n)=A001222(n) is the number of prime divisors of n (counted with multiplicity).
- Numbers k such that bigomega(k+1)==0 (mod bigomega(k)) where bigomega(n)=A001222(n) is the number of prime divisors of n (counted with multiplicity).A066935
Numbers k such that bigomega(k+1)==0 (mod bigomega(k)) where bigomega(n)=A001222(n) is the number of prime divisors of n (counted with multiplicity).
- Integers k such that prime(k)-1 == 0 (mod phi(k)) where prime(n)=A000040(n) is the n-th prime and phi(n)=A000010(n) is the Euler totient function.A066936
Integers k such that prime(k)-1 == 0 (mod phi(k)) where prime(n)=A000040(n) is the n-th prime and phi(n)=A000010(n) is the Euler totient function.
- For n=1,2,3,..., define b(n) as follows: initialize v at v=n; then for k=2,3,4,..., if v>0 and k divides v, replace v with v-k. Set b(n)=v. Then {a(n)} is the subsequence consisting of the nonzero terms of {b(n)}.A066937
For n=1,2,3,..., define b(n) as follows: initialize v at v=n; then for k=2,3,4,..., if v>0 and k divides v, replace v with v-k. Set b(n)=v. Then {a(n)} is the subsequence consisting of the nonzero terms of {b(n)}.
- Primes of the form p*q+p+q, where p and q are primes.A066938
Primes of the form p*q+p+q, where p and q are primes.
- Numbers n such that phi(phi(n)) + sigma(sigma(n)) - phi(sigma(n)) - sigma(phi(n)) = phi(n) + sigma(n).A066939
Numbers n such that phi(phi(n)) + sigma(sigma(n)) - phi(sigma(n)) - sigma(phi(n)) = phi(n) + sigma(n).
- Numbers k such that gcd(prime(k+1) + 1, prime(k) + 1) = 2.A066940
Numbers k such that gcd(prime(k+1) + 1, prime(k) + 1) = 2.
- Numbers k such that gcd(prime(k+1) + 1, prime(k) + 1) = 4.A066941
Numbers k such that gcd(prime(k+1) + 1, prime(k) + 1) = 4.
- Numbers k such that gcd(prime(k+1) + 1, prime(k) + 1) = 6.A066942
Numbers k such that gcd(prime(k+1) + 1, prime(k) + 1) = 6.
- Numbers k such that gcd(prime(k+1) + 1, prime(k) + 1) = 8.A066943
Numbers k such that gcd(prime(k+1) + 1, prime(k) + 1) = 8.
- Numbers k such that gcd(prime(k+1) + 1, prime(k) + 1) = 10.A066944
Numbers k such that gcd(prime(k+1) + 1, prime(k) + 1) = 10.
- Numbers n such that phi(phi(n)) + sigma(sigma(n)) - phi(sigma(n)) - sigma(phi(n)) = phi(n).A066945
Numbers n such that phi(phi(n)) + sigma(sigma(n)) - phi(sigma(n)) - sigma(phi(n)) = phi(n).
- Numbers n such that phi(phi(n)) + sigma(sigma(n)) - phi(sigma(n)) - sigma(phi(n)) = sigma(n).A066946
Numbers n such that phi(phi(n)) + sigma(sigma(n)) - phi(sigma(n)) - sigma(phi(n)) = sigma(n).
- Number of elements of order 2 in GL(2,Z_n).A066947
Number of elements of order 2 in GL(2,Z_n).
- Triangle of prime signature of A007870(n), read by rows.A066948
Triangle of prime signature of A007870(n), read by rows.
- Take the sum of the previous two terms, subtract n if this sum is greater than n.A066949
Take the sum of the previous two terms, subtract n if this sum is greater than n.
- Numbers k such that phi(sigma(k)) + sigma(phi(k)) = 2k.A066950
Numbers k such that phi(sigma(k)) + sigma(phi(k)) = 2k.
- Number of nonisomorphic connected graphs that can be drawn in the plane using n unit-length edges.A066951
Number of nonisomorphic connected graphs that can be drawn in the plane using n unit-length edges.
- Smallest m such that A072410(m) = n.A066952
Smallest m such that A072410(m) = n.
- Integers of the form (k!+1)/prime(k).A066953
Integers of the form (k!+1)/prime(k).
- Erroneous version of A034444.A066954
Erroneous version of A034444.
- Number of unordered solutions of x*y + y*z + z*x = n, x,y,z > 0.A066955
Number of unordered solutions of x*y + y*z + z*x = n, x,y,z > 0.
- a(n) is the number of ways of placing '+' and '-' among the digits 123456789 so that the result of the expression is n, '-' before 1 not allowed.A066956
a(n) is the number of ways of placing '+' and '-' among the digits 123456789 so that the result of the expression is n, '-' before 1 not allowed.
- a(n) = number of ways of placing '+' and '-' among the digits 123456789 so that the result of the expression is n, '-' before 1 IS allowed.A066957
a(n) = number of ways of placing '+' and '-' among the digits 123456789 so that the result of the expression is n, '-' before 1 IS allowed.
- Number of ordered primitive solutions (x,y,z) to xy + yz + zx = n with x,y,z >= 1.A066958
Number of ordered primitive solutions (x,y,z) to xy + yz + zx = n with x,y,z >= 1.
- a(n) = bigomega(n^n) where bigomega(x) is the number of prime factors in x (counted with multiplicity).A066959
a(n) = bigomega(n^n) where bigomega(x) is the number of prime factors in x (counted with multiplicity).
- Duplicate of A061827.A066960
Duplicate of A061827.