Sequences
392,541 sequences
- Nonprime numbers k such that phi(k-phi(k)) = A054571(k) is not a power of 2.A070811
Nonprime numbers k such that phi(k-phi(k)) = A054571(k) is not a power of 2.
- a(n) = phi(gpf(n)) - gpf(phi(n)) = A000010(A006530(n)) - A006530(A000010(n)).A070812
a(n) = phi(gpf(n)) - gpf(phi(n)) = A000010(A006530(n)) - A006530(A000010(n)).
- Fermat primes minus 3.A070813
Fermat primes minus 3.
- Solutions to phi(gpf(x)) - gpf(phi(x)) = 14 = c are special multiples of 17, x = 17k, where greatest prime factors of factor k were observed from {2, 3, 5}, i.e., it is smaller than 17. See solutions to other even cases of c (=A070813): A007283 for 0, A070004 for 2, A070815 for 254, A070816 for 65534. Gpf = greatest prime factor.A070814
Solutions to phi(gpf(x)) - gpf(phi(x)) = 14 = c are special multiples of 17, x = 17k, where greatest prime factors of factor k were observed from {2, 3, 5}, i.e., it is smaller than 17. See solutions to other even cases of c (=A070813): A007283 for 0, A070004 for 2, A070815 for 254, A070816 for 65534. Gpf = greatest prime factor.
- Solutions to phi(gpf(x)) - gpf(phi(x)) = 254 = c are special multiples of 257, x = 257k, where largest prime factors of factor k were observed from {2, 3, 5, 17}. See solutions to other even cases of c (=A070813): A007283 for 0, A070004 for 2, A070814 for 14, A070816 for 65534.A070815
Solutions to phi(gpf(x)) - gpf(phi(x)) = 254 = c are special multiples of 257, x = 257k, where largest prime factors of factor k were observed from {2, 3, 5, 17}. See solutions to other even cases of c (=A070813): A007283 for 0, A070004 for 2, A070814 for 14, A070816 for 65534.
- Solutions to phi(gpf(x)) - gpf(phi(x)) = 65534 = c are special multiples of 65537, x=65537*k, where the largest prime factors of factor k were observed in {2, 3, 5, 17, 257}.A070816
Solutions to phi(gpf(x)) - gpf(phi(x)) = 65534 = c are special multiples of 65537, x=65537*k, where the largest prime factors of factor k were observed in {2, 3, 5, 17, 257}.
- a(n) = floor(n/2) - gpf(phi(n)), where gpf(n) is the largest prime factor of n.A070817
a(n) = floor(n/2) - gpf(phi(n)), where gpf(n) is the largest prime factor of n.
- Smallest argument m such that commutator[phi(m), gpf(m)] = 2n-1, where phi(m) = A000010(m) and gpf(m) = A006530(m), the largest prime factor of m.A070818
Smallest argument m such that commutator[phi(m), gpf(m)] = 2n-1, where phi(m) = A000010(m) and gpf(m) = A006530(m), the largest prime factor of m.
- Values of commutator[phi,gpf] = commutator[A000010, A006530] at prime arguments; a(1)=0 by convention.A070819
Values of commutator[phi,gpf] = commutator[A000010, A006530] at prime arguments; a(1)=0 by convention.
- Difference between n-th prime and the value of commutator[phi,gpf] = commutator[A000010, A006530] at the same prime argument.A070820
Difference between n-th prime and the value of commutator[phi,gpf] = commutator[A000010, A006530] at the same prime argument.
- Integer part of n/(lpf(n)*gpf(n)), where lpf = A020639 is the least prime factor and gpf = A006530 the greatest prime factor.A070821
Integer part of n/(lpf(n)*gpf(n)), where lpf = A020639 is the least prime factor and gpf = A006530 the greatest prime factor.
- Number of Cayley graphs isomorphic to the graph of the n-dimensional cube.A070822
Number of Cayley graphs isomorphic to the graph of the n-dimensional cube.
- a(1)=0, a(1)=1, a(n+2)=abs(concatenate(a(n+1)a(n))-concatenate(a(n)a(n+1))).A070823
a(1)=0, a(1)=1, a(n+2)=abs(concatenate(a(n+1)a(n))-concatenate(a(n)a(n+1))).
- Number of divisors of n which are > 1 and < n (nontrivial divisors).A070824
Number of divisors of n which are > 1 and < n (nontrivial divisors).
- One half of product of first n+1 Lucas numbers A000032.A070825
One half of product of first n+1 Lucas numbers A000032.
- One half of product of first n primes A000040.A070826
One half of product of first n primes A000040.
- Sum of prime factors of Lucas numbers A000032(n),n=0, n>=2, with n=1 term added.A070827
Sum of prime factors of Lucas numbers A000032(n),n=0, n>=2, with n=1 term added.
- Sum of prime factors of Catalan numbers A000108(n), n>=2, with n=0 and n=1 terms added.A070828
Sum of prime factors of Catalan numbers A000108(n), n>=2, with n=0 and n=1 terms added.
- Array showing which primes divide n >= 2.A070829
Array showing which primes divide n >= 2.
- Number of wide partitions of n.A070830
Number of wide partitions of n.
- Palindromic primes with digit sum = 11.A070831
Palindromic primes with digit sum = 11.
- a(n) = Sum_{k=0..n} binomial(8*n,8*k).A070832
a(n) = Sum_{k=0..n} binomial(8*n,8*k).
- a(n) = Sum_{k=0..n} binomial(10*n,10*k).A070833
a(n) = Sum_{k=0..n} binomial(10*n,10*k).
- a(n) = reverse(n)^n.A070834
a(n) = reverse(n)^n.
- Numbers n such that phi(reverse(n)) = sigma(n).A070835
Numbers n such that phi(reverse(n)) = sigma(n).
- Duplicate of A063432.A070836
Duplicate of A063432.
- Smallest number k such that abs(k - R(k)) = 9n, where R(k) is digit reversal of k (A004086); or 0 if no such k exists.A070837
Smallest number k such that abs(k - R(k)) = 9n, where R(k) is digit reversal of k (A004086); or 0 if no such k exists.
- Smallest prime p such that |p - R(p)| = 9n, where R(n) is digit reversal of n, A004086; or 0 if no such prime exists.A070838
Smallest prime p such that |p - R(p)| = 9n, where R(n) is digit reversal of n, A004086; or 0 if no such prime exists.
- Smallest number k such that k + R(k) is a multiple of 11 different from all previous cases, where R(k) is digit reversal of k (A004086).A070839
Smallest number k such that k + R(k) is a multiple of 11 different from all previous cases, where R(k) is digit reversal of k (A004086).
- Repdigits (A010785) ordered by sum of digits (A007953).A070840
Repdigits (A010785) ordered by sum of digits (A007953).
- Repdigits (A010785), excluding repunits (A002275), ordered by product of digits (A007954).A070841
Repdigits (A010785), excluding repunits (A002275), ordered by product of digits (A007954).
- Smallest n-digit number with exactly n prime divisors. There are no further terms.A070842
Smallest n-digit number with exactly n prime divisors. There are no further terms.
- Largest n-digit number with exactly n distinct prime divisors. There are no further terms.A070843
Largest n-digit number with exactly n distinct prime divisors. There are no further terms.
- a(n) = smallest n-digit number with exactly n divisors, or 0 if no such number exists.A070844
a(n) = smallest n-digit number with exactly n divisors, or 0 if no such number exists.
- Largest n-digit number with exactly n divisors, or 0 if no such number exists.A070845
Largest n-digit number with exactly n divisors, or 0 if no such number exists.
- Smallest prime == 1 (mod 2n).A070846
Smallest prime == 1 (mod 2n).
- Smallest prime == 1 mod (3n).A070847
Smallest prime == 1 mod (3n).
- Smallest prime == 1 mod (4n).A070848
Smallest prime == 1 mod (4n).
- Smallest prime == 1 mod (5n).A070849
Smallest prime == 1 mod (5n).
- Smallest prime == 1 mod (6n).A070850
Smallest prime == 1 mod (6n).
- Smallest prime == 1 mod (7n).A070851
Smallest prime == 1 mod (7n).
- Smallest prime == 1 mod (8n).A070852
Smallest prime == 1 mod (8n).
- Smallest prime == 1 mod (9n).A070853
Smallest prime == 1 mod (9n).
- Smallest prime == 1 mod (10^n).A070854
Smallest prime == 1 mod (10^n).
- Smallest prime of the form k*n^n + 1.A070855
Smallest prime of the form k*n^n + 1.
- Numbers n such that sigma(reverse(n)) = phi(n).A070856
Numbers n such that sigma(reverse(n)) = phi(n).
- Expansion of (1+x*C)*C^4, where C = (1-(1-4*x)^(1/2))/(2*x) is g.f. for Catalan numbers, A000108.A070857
Expansion of (1+x*C)*C^4, where C = (1-(1-4*x)^(1/2))/(2*x) is g.f. for Catalan numbers, A000108.
- Smallest prime == 1 mod L, where L = LCM of 1 to n.A070858
Smallest prime == 1 mod L, where L = LCM of 1 to n.
- Expansion of (1+x*C^4)*C, where C = (1-(1-4*x)^(1/2))/(2*x) is g.f. for Catalan numbers, A000108.A070859
Expansion of (1+x*C^4)*C, where C = (1-(1-4*x)^(1/2))/(2*x) is g.f. for Catalan numbers, A000108.
- Decimal expansion of Pi^2/12 - gamma^2 /2.A070860
Decimal expansion of Pi^2/12 - gamma^2 /2.