Sequences
392,541 sequences
- Numbers k such that pi(k) is even.A057811
Numbers k such that pi(k) is even.
- Numbers k such that pi(k) is odd.A057812
Numbers k such that pi(k) is odd.
- a(n) = (2*n+1)*(4*n^2+4*n+3)/3.A057813
a(n) = (2*n+1)*(4*n^2+4*n+3)/3.
- Number of partitions of an n-set into blocks of size > 4.A057814
Number of partitions of an n-set into blocks of size > 4.
- a(n) = gcd(n,binomial(n,floor(n/2))).A057815
a(n) = gcd(n,binomial(n,floor(n/2))).
- If a(n) = 0 mod 3 then a(n+1)=a(n)/3 otherwise a(n+1)=4*a(n)+-1 where sign is chosen to give a multiple of 3.A057816
If a(n) = 0 mod 3 then a(n+1)=a(n)/3 otherwise a(n+1)=4*a(n)+-1 where sign is chosen to give a multiple of 3.
- Moebius invariant of cographic hyperplane arrangement for complete graph K_n. Also value of Tutte dichromatic polynomial T_G(0,1) for G=K_n. Also alternating sum F_{n,1} - F_{n,2} + F_{n,3} - ..., where F_{n,k} is the number of labeled forests on n nodes with k connected components.A057817
Moebius invariant of cographic hyperplane arrangement for complete graph K_n. Also value of Tutte dichromatic polynomial T_G(0,1) for G=K_n. Also alternating sum F_{n,1} - F_{n,2} + F_{n,3} - ..., where F_{n,k} is the number of labeled forests on n nodes with k connected components.
- Number of factorable (see A057765 for definition) subsets of a 2 X n uniform grid.A057818
Number of factorable (see A057765 for definition) subsets of a 2 X n uniform grid.
- a(0)=4, a(1)=9, a(n) = 4a(n-1) - a(n-2).A057819
a(0)=4, a(1)=9, a(n) = 4a(n-1) - a(n-2).
- First differences of sequence of consecutive prime powers (A000961).A057820
First differences of sequence of consecutive prime powers (A000961).
- a(n) is the least nonnegative integer k such that 2^n - k is a safe prime.A057821
a(n) is the least nonnegative integer k such that 2^n - k is a safe prime.
- Smaller of pair of twin primes whose average is lcm(1,...,m) for some m.A057822
Smaller of pair of twin primes whose average is lcm(1,...,m) for some m.
- Decimal expansion of q = 0.193072033..., which is the value of q which gives the maximum of the Dedekind eta function eta(q) := q^(1/12) * Product_{n>=1} (1 - q^(2n)) for q between 0 and 1.A057823
Decimal expansion of q = 0.193072033..., which is the value of q which gives the maximum of the Dedekind eta function eta(q) := q^(1/12) * Product_{n>=1} (1 - q^(2n)) for q between 0 and 1.
- Primes p such that p+1 is LCM(1,...,m) for some (usually more than one) m.A057824
Primes p such that p+1 is LCM(1,...,m) for some (usually more than one) m.
- Values of k for which A003418(k) - 1 is prime.A057825
Values of k for which A003418(k) - 1 is prime.
- Greatest number with totient 2n (or zero when no such number exists).A057826
Greatest number with totient 2n (or zero when no such number exists).
- a(0) = 1; a(n) = LCM(n, sum{k=0 to n-1}[a(k)]).A057827
a(0) = 1; a(n) = LCM(n, sum{k=0 to n-1}[a(k)]).
- Number of perfect squares, k^2, where k^2 <= n and gcd(k,n) = 1.A057828
Number of perfect squares, k^2, where k^2 <= n and gcd(k,n) = 1.
- Numbers n such that n | 5^n + 3^n +1.A057829
Numbers n such that n | 5^n + 3^n +1.
- Numbers n such that n | 7^n + 5^n + 3^n +1.A057830
Numbers n such that n | 7^n + 5^n + 3^n +1.
- Numbers n such that n | 9^n + 7^n + 5^n + 3^n +1.A057831
Numbers n such that n | 9^n + 7^n + 5^n + 3^n +1.
- Numbers n such that n | 11^n + 9^n + 7^n + 5^n + 3^n + 1.A057832
Numbers n such that n | 11^n + 9^n + 7^n + 5^n + 3^n + 1.
- Numbers n such that n | 13^n + 11^n + 9^n + 7^n + 5^n + 3^n +1.A057833
Numbers n such that n | 13^n + 11^n + 9^n + 7^n + 5^n + 3^n +1.
- Integer nearest to 10^n / log(10^n).A057834
Integer nearest to 10^n / log(10^n).
- Difference between pi(10^n) and the integer nearest to 10^n / log(10^n).A057835
Difference between pi(10^n) and the integer nearest to 10^n / log(10^n).
- Integers with 2 or more pairs of consecutive anti-divisors.A057836
Integers with 2 or more pairs of consecutive anti-divisors.
- Number of partitions of a set of n elements where the partitions are of size > 3.A057837
Number of partitions of a set of n elements where the partitions are of size > 3.
- Numbers k such that A055079(k) = 2^k.A057838
Numbers k such that A055079(k) = 2^k.
- Numbers k such that k | 10^k + 8^k + 6^k + 4^k + 2^k + 1.A057839
Numbers k such that k | 10^k + 8^k + 6^k + 4^k + 2^k + 1.
- Numbers n such that n | 8^n + 6^n + 4^n + 2^n + 1.A057840
Numbers n such that n | 8^n + 6^n + 4^n + 2^n + 1.
- a(n) = 2^A057838(n) corresponding to extremal cases of A055079.A057841
a(n) = 2^A057838(n) corresponding to extremal cases of A055079.
- Numbers k such that k | 6^k + 4^k + 2^k + 1.A057842
Numbers k such that k | 6^k + 4^k + 2^k + 1.
- a(n) = floor(n*tau^2) - 3, where tau = (1+sqrt(5))/2.A057843
a(n) = floor(n*tau^2) - 3, where tau = (1+sqrt(5))/2.
- Numbers n such that n | 6^n + 4^n + 2^n.A057844
Numbers n such that n | 6^n + 4^n + 2^n.
- Numbers k such that k | 4^k + 2^k + 1.A057845
Numbers k such that k | 4^k + 2^k + 1.
- Sort the digits of n into alphabetical order (the "Obsessive Filer's Sequence").A057846
Sort the digits of n into alphabetical order (the "Obsessive Filer's Sequence").
- Primes p whose order of primeness A078442(p) is at least 10.A057847
Primes p whose order of primeness A078442(p) is at least 10.
- Number of 1-connected claw-free cubic graphs with 2n nodes.A057848
Number of 1-connected claw-free cubic graphs with 2n nodes.
- Primes p whose order of primeness A078442(p) is at least 7.A057849
Primes p whose order of primeness A078442(p) is at least 7.
- Primes p whose order of primeness A078442(p) is at least 8.A057850
Primes p whose order of primeness A078442(p) is at least 8.
- Primes p whose order of primeness A078442(p) is at least 9.A057851
Primes p whose order of primeness A078442(p) is at least 9.
- Numbers n such that n | Sigma_2(n) + Sigma_1(n) + Sigma_0(n).A057852
Numbers n such that n | Sigma_2(n) + Sigma_1(n) + Sigma_0(n).
- Number of letters in n (in Esperanto).A057853
Number of letters in n (in Esperanto).
- Non-Lucas numbers: the complement of A000032.A057854
Non-Lucas numbers: the complement of A000032.
- Greatest k such that (k-th prime) <= (n times n-th prime).A057855
Greatest k such that (k-th prime) <= (n times n-th prime).
- Least k such that (n+1)^k + n^k is a prime.A057856
Least k such that (n+1)^k + n^k is a prime.
- Number of residue classes modulo n-th primorial number which contain a prime.A057857
Number of residue classes modulo n-th primorial number which contain a prime.
- Number of residue classes modulo n-th primorial number which contain only composite numbers.A057858
Number of residue classes modulo n-th primorial number which contain only composite numbers.
- Number of residue classes modulo n which contain a prime.A057859
Number of residue classes modulo n which contain a prime.
- Number of residue classes modulo n which contain only composite numbers.A057860
Number of residue classes modulo n which contain only composite numbers.