Sequences
392,541 sequences
- Triangle T(n,k) is the number of restricted growth strings (RGS) of set partitions of {1..n} that have an increase at index k (1<=k<n).A056861
Triangle T(n,k) is the number of restricted growth strings (RGS) of set partitions of {1..n} that have an increase at index k (1<=k<n).
- Triangle T(n,k) is the number of restricted growth strings (RGS) of set partitions of {1..n} that have a decrease at index k (1<=k<n).A056862
Triangle T(n,k) is the number of restricted growth strings (RGS) of set partitions of {1..n} that have a decrease at index k (1<=k<n).
- Related to triangle A056858 of number of rises in set partitions of n at a given index i.A056863
Related to triangle A056858 of number of rises in set partitions of n at a given index i.
- Nearest integer to n^2/10.A056864
Nearest integer to n^2/10.
- a(n) = floor(n^2/10).A056865
a(n) = floor(n^2/10).
- Orders of non-solvable groups, i.e., numbers that are not solvable numbers.A056866
Orders of non-solvable groups, i.e., numbers that are not solvable numbers.
- Nilpotent numbers: n such that every group of order n is nilpotent.A056867
Nilpotent numbers: n such that every group of order n is nilpotent.
- Numbers that are not nilpotent numbers.A056868
Numbers that are not nilpotent numbers.
- Prime hypotenuses of Pythagorean triangles with consecutive integer sides.A056869
Prime hypotenuses of Pythagorean triangles with consecutive integer sides.
- Difference between partial sums of partition numbers (A026905) and partial sums of numbers of partitions into distinct parts (A026906).A056870
Difference between partial sums of partition numbers (A026905) and partial sums of numbers of partitions into distinct parts (A026906).
- Sum of partial sums of partition numbers (A026905) and partial sums of numbers of partitions into distinct parts (A026906).A056871
Sum of partial sums of partition numbers (A026905) and partial sums of numbers of partitions into distinct parts (A026906).
- Numbers k such that k | p(k) + q(k) where p(k) = partition numbers (A000041) and q(k) = partition numbers into distinct parts (A000009).A056872
Numbers k such that k | p(k) + q(k) where p(k) = partition numbers (A000041) and q(k) = partition numbers into distinct parts (A000009).
- Numbers k such that k | p(k) - q(k) where p(k) = partition numbers (A000041) and q(k) = partition numbers into distinct parts (A000009).A056873
Numbers k such that k | p(k) - q(k) where p(k) = partition numbers (A000041) and q(k) = partition numbers into distinct parts (A000009).
- Primes of form x^2+xy+3y^2, discriminant -11.A056874
Primes of form x^2+xy+3y^2, discriminant -11.
- Generated by sieving the natural numbers: keep the smallest remaining number k and take out its k-th successor l as well as the l-th successor m of l, the m-th successor of m and so on. Then start again from the next remaining number.A056875
Generated by sieving the natural numbers: keep the smallest remaining number k and take out its k-th successor l as well as the l-th successor m of l, the m-th successor of m and so on. Then start again from the next remaining number.
- Number of permutations (p_1, ..., p_n) of {1,...,n} that are "balanced" in the sense that the sum of k*p_k equals the sum of (n+1-k)*p_k; equivalently, the expected value of k*p_k is (expected value of k) times (expected value of p_k), assuming the uniform distribution.A056876
Number of permutations (p_1, ..., p_n) of {1,...,n} that are "balanced" in the sense that the sum of k*p_k equals the sum of (n+1-k)*p_k; equivalently, the expected value of k*p_k is (expected value of k) times (expected value of p_k), assuming the uniform distribution.
- Number of polyominoes with n cells, symmetric about two orthogonal axes.A056877
Number of polyominoes with n cells, symmetric about two orthogonal axes.
- Number of polyominoes with n cells, symmetric about diagonal 2.A056878
Number of polyominoes with n cells, symmetric about diagonal 2.
- Number of n-celled axially symmetric polyominoes without holes.A056879
Number of n-celled axially symmetric polyominoes without holes.
- Number of n-celled polyominoes without holes, symmetric about axis 2.A056880
Number of n-celled polyominoes without holes, symmetric about axis 2.
- Number of n-celled diagonally symmetric polyominoes without holes.A056881
Number of n-celled diagonally symmetric polyominoes without holes.
- Number of n-celled free polyominoes that have no holes and are symmetric about two diagonal axes (and therefore centrally symmetric) but have no other symmetries.A056882
Number of n-celled free polyominoes that have no holes and are symmetric about two diagonal axes (and therefore centrally symmetric) but have no other symmetries.
- Number of n-celled rotationally symmetric polyominoes without holes.A056883
Number of n-celled rotationally symmetric polyominoes without holes.
- Number of asymmetric n-celled polyominoes without holes.A056884
Number of asymmetric n-celled polyominoes without holes.
- Triangle T(n,k) = number of minimal covers of an unlabeled n-set that cover k points of that set uniquely, k=0..n.A056885
Triangle T(n,k) = number of minimal covers of an unlabeled n-set that cover k points of that set uniquely, k=0..n.
- Determinant of the n X n Hankel matrix whose entries are s_2 (i+j), 0 <= i, j < n, where s_2 is the sum of the base-2 bits.A056886
Determinant of the n X n Hankel matrix whose entries are s_2 (i+j), 0 <= i, j < n, where s_2 is the sum of the base-2 bits.
- Determinant of n X n Hankel matrix whose entries are t(i+j), 0 <= i, j < n, where t is the Thue-Morse sequence.A056887
Determinant of n X n Hankel matrix whose entries are t(i+j), 0 <= i, j < n, where t is the Thue-Morse sequence.
- a(n) = number of k such that sum of digits of 9^k is 9n.A056888
a(n) = number of k such that sum of digits of 9^k is 9n.
- Numerators of continued fraction for left factorial.A056889
Numerators of continued fraction for left factorial.
- Denominators of continued fraction for left factorial.A056890
Denominators of continued fraction for left factorial.
- a(n) = (s(n)-(n mod 2)) / n where s(n) is A006533.A056891
a(n) = (s(n)-(n mod 2)) / n where s(n) is A006533.
- a(n) = square excess of the n-th prime.A056892
a(n) = square excess of the n-th prime.
- Smallest prime with square excess of n.A056893
Smallest prime with square excess of n.
- If the smallest prime with a square excess of n is p then a(n)=p-n.A056894
If the smallest prime with a square excess of n is p then a(n)=p-n.
- If the smallest prime with a square excess of n is p then a(n)^2 = p - n.A056895
If the smallest prime with a square excess of n is p then a(n)^2 = p - n.
- Smallest prime which can be written as k^2 + n for k >= 0.A056896
Smallest prime which can be written as k^2 + n for k >= 0.
- Smallest square where a(n)+n is prime.A056897
Smallest square where a(n)+n is prime.
- a(n) = smallest number m such that m^2+n is prime.A056898
a(n) = smallest number m such that m^2+n is prime.
- Primes of the form k^2 + 2.A056899
Primes of the form k^2 + 2.
- Numbers n where 36n^2+36n+11 is prime.A056900
Numbers n where 36n^2+36n+11 is prime.
- Least semiperimeter s of primitive Pythagorean triangle with inradius n.A056901
Least semiperimeter s of primitive Pythagorean triangle with inradius n.
- Numbers n where 36n^2+24n+7 is prime (sorted by absolute values with negatives before positives).A056902
Numbers n where 36n^2+24n+7 is prime (sorted by absolute values with negatives before positives).
- Numbers n such that the numerator of the rational number 1 + 1/2 + 1/3 + ... + 1/n is a prime number.A056903
Numbers n such that the numerator of the rational number 1 + 1/2 + 1/3 + ... + 1/n is a prime number.
- Floor[p/24] where p is a prime which is 4 more than a square.A056904
Floor[p/24] where p is a prime which is 4 more than a square.
- Primes of the form k^2 + 5.A056905
Primes of the form k^2 + 5.
- Numbers k such that 36*k^2 + 5 is prime.A056906
Numbers k such that 36*k^2 + 5 is prime.
- Numbers k such that 36*k^2 + 12*k + 5 is prime (sorted by absolute values with negatives before positives).A056907
Numbers k such that 36*k^2 + 12*k + 5 is prime (sorted by absolute values with negatives before positives).
- Numbers k such that 36*k^2 + 36*k + 13 is prime.A056908
Numbers k such that 36*k^2 + 36*k + 13 is prime.
- Primes of the form k^2+6.A056909
Primes of the form k^2+6.
- Numbers k such that 36*k^2 + 12*k + 7 is prime (sorted by absolute values with negatives before positives).A056910
Numbers k such that 36*k^2 + 12*k + 7 is prime (sorted by absolute values with negatives before positives).