Sequences
392,541 sequences
- Primitive numbers whose decimal expansion of 1/n is equidistributed in base 10.A073761
Primitive numbers whose decimal expansion of 1/n is equidistributed in base 10.
- a(n) = 24*n - 12.A073762
a(n) = 24*n - 12.
- Least number of unrelated set belonging to these numbers is odd.A073763
Least number of unrelated set belonging to these numbers is odd.
- a(n) = least number x such that A045763(x)=n or 0 if no such number exists.A073764
a(n) = least number x such that A045763(x)=n or 0 if no such number exists.
- a(n) = binomial(prime(n), composite(n)).A073765
a(n) = binomial(prime(n), composite(n)).
- a(n) = binomial(composite(n+1), composite(n)) = binomial(A002808(n+1), A002808(n)).A073766
a(n) = binomial(composite(n+1), composite(n)) = binomial(A002808(n+1), A002808(n)).
- Bateman polynomial values n!*Z_n(-1).A073767
Bateman polynomial values n!*Z_n(-1).
- Triangle of coefficients of Bateman polynomial n!Z_n(-x).A073768
Triangle of coefficients of Bateman polynomial n!Z_n(-x).
- Duplicate of A008937.A073769
Duplicate of A008937.
- Primes p not of the form q + s where q is prime and s > 0 is the smallest square such that q + s is prime.A073770
Primes p not of the form q + s where q is prime and s > 0 is the smallest square such that q + s is prime.
- Highly composite numbers k such that 2*k is not a highly composite number.A073771
Highly composite numbers k such that 2*k is not a highly composite number.
- Number of highly composite numbers (HCNs) between the n-th highly composite number k and 2*k if 2*k is a highly composite number, or -1 if 2*k is not a highly composite number.A073772
Number of highly composite numbers (HCNs) between the n-th highly composite number k and 2*k if 2*k is a highly composite number, or -1 if 2*k is not a highly composite number.
- Number of plane binary trees of size n+2 and height n.A073773
Number of plane binary trees of size n+2 and height n.
- Number of plane binary trees of size n+3 and height n.A073774
Number of plane binary trees of size n+3 and height n.
- Polynomial (1/3)*n^3 + (9/2)*n^2 + (85/6)*n - 2.A073775
Polynomial (1/3)*n^3 + (9/2)*n^2 + (85/6)*n - 2.
- a(n) = Sum_{k=1..n} -mu(k+1) * a(n-k), with a(0)=1.A073776
a(n) = Sum_{k=1..n} -mu(k+1) * a(n-k), with a(0)=1.
- a(n) = Sum_{k=1..n} -A068341(k+1)*a(n-k), a(0)=1.A073777
a(n) = Sum_{k=1..n} -A068341(k+1)*a(n-k), a(0)=1.
- a(n) = Sum_{k=0..n} T(k)*T(n-k), where T is A000073; convolution of A000073 with itself.A073778
a(n) = Sum_{k=0..n} T(k)*T(n-k), where T is A000073; convolution of A000073 with itself.
- Number of 0's in base-3 representation of n-th prime.A073779
Number of 0's in base-3 representation of n-th prime.
- Number of 1's in base 3 representation of n-th prime.A073780
Number of 1's in base 3 representation of n-th prime.
- Number of 2's in base-3 representation of n-th prime.A073781
Number of 2's in base-3 representation of n-th prime.
- a(n) = Sum_{k=0..n} S(k)*S(n-k), convolution of S=A001644 with itself.A073782
a(n) = Sum_{k=0..n} S(k)*S(n-k), convolution of S=A001644 with itself.
- First differences of composite numbers.A073783
First differences of composite numbers.
- Number of primes between successive composite numbers.A073784
Number of primes between successive composite numbers.
- Numbers in base -3.A073785
Numbers in base -3.
- Numbers in base -5.A073786
Numbers in base -5.
- Numbers in base -6.A073787
Numbers in base -6.
- Numbers in base -7.A073788
Numbers in base -7.
- Numbers in base -8.A073789
Numbers in base -8.
- Numbers in base -9.A073790
Numbers in base -9.
- Replace 4^k with (-4)^k in base 4 expansion of n.A073791
Replace 4^k with (-4)^k in base 4 expansion of n.
- Replace 5^k with (-5)^k in base 5 expansion of n.A073792
Replace 5^k with (-5)^k in base 5 expansion of n.
- Replace 6^k with (-6)^k in base 6 expansion of n.A073793
Replace 6^k with (-6)^k in base 6 expansion of n.
- Replace 7^k with (-7)^k in base 7 expansion of n.A073794
Replace 7^k with (-7)^k in base 7 expansion of n.
- Replace 8^k with (-8)^k in base 8 expansion of n.A073795
Replace 8^k with (-8)^k in base 8 expansion of n.
- Replace 9^k with (-9)^k in base 9 expansion of n.A073796
Replace 9^k with (-9)^k in base 9 expansion of n.
- a(n) = 2^n mod pi(n).A073797
a(n) = 2^n mod pi(n).
- pi(n) is a power of 2, where pi(n) = A000720(n) is the number of primes <= n.A073798
pi(n) is a power of 2, where pi(n) = A000720(n) is the number of primes <= n.
- Numbers that begin a run of consecutive integers k such that PrimePi(k) divides 2^k.A073799
Numbers that begin a run of consecutive integers k such that PrimePi(k) divides 2^k.
- Remainder of division 2^n/c(n), where c(n)=A002808(n), the n-th composite.A073800
Remainder of division 2^n/c(n), where c(n)=A002808(n), the n-th composite.
- Duplicate of A065891.A073801
Duplicate of A065891.
- Number of common divisors of n and sigma(n).A073802
Number of common divisors of n and sigma(n).
- Numbers k such that the number of divisors of k is smaller than that of sigma(k).A073803
Numbers k such that the number of divisors of k is smaller than that of sigma(k).
- Numbers k such that the number of divisors of k is greater than that of sigma(k).A073804
Numbers k such that the number of divisors of k is greater than that of sigma(k).
- Numbers k such that 1 + k*R(k) is prime, where R(k) is the reverse of k.A073805
Numbers k such that 1 + k*R(k) is prime, where R(k) is the reverse of k.
- Number of divisors of sum of square of divisors.A073806
Number of divisors of sum of square of divisors.
- Number of divisors of sum of cube of divisors.A073807
Number of divisors of sum of cube of divisors.
- Number of common divisors of sigma_1(n) and sigma_2(n).A073808
Number of common divisors of sigma_1(n) and sigma_2(n).
- Number of common divisors of sigma_1(n) and sigma_3(n).A073809
Number of common divisors of sigma_1(n) and sigma_3(n).
- Number of common divisors of sigma(2,n) and sigma(3,n).A073810
Number of common divisors of sigma(2,n) and sigma(3,n).