Sequences
392,541 sequences
- T(n,k) = multiplicity of the k-th partition of n in Mathematica order, defined to be the count of its permutations (compositions).A072811
T(n,k) = multiplicity of the k-th partition of n in Mathematica order, defined to be the count of its permutations (compositions).
- Take the binary number P = 1.01101010001... which has an 1 in each decimal position that is a prime (e.g. 2,3,5,7...) and convert this number to base 10.A072812
Take the binary number P = 1.01101010001... which has an 1 in each decimal position that is a prime (e.g. 2,3,5,7...) and convert this number to base 10.
- a(n)^A072814(n) is the n-th perfect power.A072813
a(n)^A072814(n) is the n-th perfect power.
- Smallest exponents of perfect powers: A001597(n)=A072813(n)^a(n).A072814
Smallest exponents of perfect powers: A001597(n)=A072813(n)^a(n).
- Sum of proper divisors of 6n + 1.A072815
Sum of proper divisors of 6n + 1.
- a(n) is the smallest integer such that the mantissa of 1/a(n) contains n.A072816
a(n) is the smallest integer such that the mantissa of 1/a(n) contains n.
- Accumulative sum of the greatest digit of n minus the least digit of n (A037904) <= 10^n.A072817
Accumulative sum of the greatest digit of n minus the least digit of n (A037904) <= 10^n.
- Possibly the only integers of the form sqrt(m^2*(m^2-1)*2/3) [only checked for the first 5 terms].A072818
Possibly the only integers of the form sqrt(m^2*(m^2-1)*2/3) [only checked for the first 5 terms].
- Variance of time for a random walk starting at 0 to reach one of the boundaries at +n or -n for the first time.A072819
Variance of time for a random walk starting at 0 to reach one of the boundaries at +n or -n for the first time.
- Largest number of distinct primes to represent n as arithmetic mean.A072820
Largest number of distinct primes to represent n as arithmetic mean.
- Largest prime that can appear in any representation of n as an arithmetic mean of distinct primes.A072821
Largest prime that can appear in any representation of n as an arithmetic mean of distinct primes.
- The terms of A073215 (sums of two powers of 23) divided by 2.A072822
The terms of A073215 (sums of two powers of 23) divided by 2.
- Numbers that are not the sum of two powers of 2.A072823
Numbers that are not the sum of two powers of 2.
- Sum of aliquot divisors of Ramanujan's highly composite numbers.A072824
Sum of aliquot divisors of Ramanujan's highly composite numbers.
- Numbers k such that k^2 - 1 is a highly composite number.A072825
Numbers k such that k^2 - 1 is a highly composite number.
- Primes p such that p-1 is a highly composite number.A072826
Primes p such that p-1 is a highly composite number.
- Number of permutations satisfying i-2<=p(i)<=i+3, i=1..n.A072827
Number of permutations satisfying i-2<=p(i)<=i+3, i=1..n.
- Primes p such that p+1 is a highly composite number.A072828
Primes p such that p+1 is a highly composite number.
- Greatest m such that Product_{k=1..n-1} (1 - k/m) <= 1/2.A072829
Greatest m such that Product_{k=1..n-1} (1 - k/m) <= 1/2.
- Absolute value of 2*b(n)-9*n, where b(n) = accumulative sum of the greatest digit of n minus the least digit of n (A037904).A072830
Absolute value of 2*b(n)-9*n, where b(n) = accumulative sum of the greatest digit of n minus the least digit of n (A037904).
- Number of bits in n!.A072831
Number of bits in n!.
- First differences of Ulam's sequence A002858.A072832
First differences of Ulam's sequence A002858.
- Numbers that are congruent to 0, 5, 8, 9 mod 12.A072833
Numbers that are congruent to 0, 5, 8, 9 mod 12.
- Exponents occurring in expansion of F_8(q^2).A072834
Exponents occurring in expansion of F_8(q^2).
- Exponents occurring in expansion of F_9(q^2).A072835
Exponents occurring in expansion of F_9(q^2).
- Exponents occurring in expansion of F_10(q^2).A072836
Exponents occurring in expansion of F_10(q^2).
- Duplicate of A023917.A072837
Duplicate of A023917.
- Duplicate of A023919.A072838
Duplicate of A023919.
- Expansion of F_9(q^2).A072839
Expansion of F_9(q^2).
- Duplicate of A023921.A072840
Duplicate of A023921.
- Numbers k such that the digits of k^2 are exactly the same (albeit in different order) as the digits of (k+1)^2.A072841
Numbers k such that the digits of k^2 are exactly the same (albeit in different order) as the digits of (k+1)^2.
- Largest m such that we can partition the set {1,2,...,m} into n subsets with the property that we never have a+b=c for any distinct elements a, b, c in one subset.A072842
Largest m such that we can partition the set {1,2,...,m} into n subsets with the property that we never have a+b=c for any distinct elements a, b, c in one subset.
- O'Halloran numbers: even integers which cannot be the surface area of a cuboid with integer-length sides.A072843
O'Halloran numbers: even integers which cannot be the surface area of a cuboid with integer-length sides.
- Number of words of length 2n-1 generated by the two letters s and t that reduce to the identity 1 by using the relations sssssss=1, tt=1 and stst=1. The generators s and t along with the three relations generate the 14-element dihedral group D7.A072844
Number of words of length 2n-1 generated by the two letters s and t that reduce to the identity 1 by using the relations sssssss=1, tt=1 and stst=1. The generators s and t along with the three relations generate the 14-element dihedral group D7.
- {1, 3, 7, 9} -> Mod[ {1*{1, 3, 7, 9}, 3*{1, 3, 7, 9}, 7*{1, 3, 7, 9}, 9*{1, 3, 7, 9}}, 10}.A072845
{1, 3, 7, 9} -> Mod[ {1*{1, 3, 7, 9}, 3*{1, 3, 7, 9}, 7*{1, 3, 7, 9}, 9*{1, 3, 7, 9}}, 10}.
- The a(n)-th highly-composite number (A002182) is the first one divisible by the n-th prime.A072846
The a(n)-th highly-composite number (A002182) is the first one divisible by the n-th prime.
- The a(n)-th highly-composite number (A002182) is the first one divisible by 2^n.A072847
The a(n)-th highly-composite number (A002182) is the first one divisible by 2^n.
- Largest prime factor of 10^(6*n) + 1.A072848
Largest prime factor of 10^(6*n) + 1.
- Prime(a(n)) + ... + prime(a(n)+3) is a square = A051395(n)^2.A072849
Prime(a(n)) + ... + prime(a(n)+3) is a square = A051395(n)^2.
- Number of permutations p of [n] satisfying i-2 <= p(i) <= i+4 for all i in [n].A072850
Number of permutations p of [n] satisfying i-2 <= p(i) <= i+4 for all i in [n].
- a(n) = s(2*n) where s(0) = 0, s(1) = s(2) = 1, s(n) = abs(Sum_{k=2..n-1} (-1)^k * s(n-k) * s(k)).A072851
a(n) = s(2*n) where s(0) = 0, s(1) = s(2) = 1, s(n) = abs(Sum_{k=2..n-1} (-1)^k * s(n-k) * s(k)).
- Number of permutations satisfying i-2<=p(i)<=i+5, i=1..n.A072852
Number of permutations satisfying i-2<=p(i)<=i+5, i=1..n.
- Number of permutations satisfying i-2<=p(i)<=i+6, i=1..n.A072853
Number of permutations satisfying i-2<=p(i)<=i+6, i=1..n.
- Number of permutations satisfying i-3<=p(i)<=i+4, i=1..n.A072854
Number of permutations satisfying i-3<=p(i)<=i+4, i=1..n.
- Number of permutations satisfying i-3<=p(i)<=i+5, i=1..n.A072855
Number of permutations satisfying i-3<=p(i)<=i+5, i=1..n.
- Number of permutations satisfying i-4<=p(i)<=i+4, i=1..n (permutations of length n within distance 4).A072856
Number of permutations satisfying i-4<=p(i)<=i+4, i=1..n (permutations of length n within distance 4).
- Primeval numbers: numbers that set a record for the number of distinct primes that can be obtained by permuting some subset of their digits.A072857
Primeval numbers: numbers that set a record for the number of distinct primes that can be obtained by permuting some subset of their digits.
- Primes p such that the period of the decimal expansion of 1/p is a square.A072858
Primes p such that the period of the decimal expansion of 1/p is a square.
- Primes p for which the period of 1/p is prime.A072859
Primes p for which the period of 1/p is prime.
- Highest power of 3 dividing the period length of 1/prime(n) = A002371(n).A072860
Highest power of 3 dividing the period length of 1/prime(n) = A002371(n).