Sequences
392,541 sequences
- From the Bruck-Ryser theorem: numbers n == 1 or 2 (mod 4) which are also the sum of 2 squares.A046711
From the Bruck-Ryser theorem: numbers n == 1 or 2 (mod 4) which are also the sum of 2 squares.
- From the Bruck-Ryser theorem: n == 1 or 2 (mod 4) which are not the sum of 2 squares.A046712
From the Bruck-Ryser theorem: n == 1 or 2 (mod 4) which are not the sum of 2 squares.
- Multiplicative and additive primes: primes where the product and sum of digits are also prime.A046713
Multiplicative and additive primes: primes where the product and sum of digits are also prime.
- Convolution of A000108 (Catalan) with A000351 (powers of 5).A046714
Convolution of A000108 (Catalan) with A000351 (powers of 5).
- Secondary root edges in doubly rooted tree maps with n edges.A046715
Secondary root edges in doubly rooted tree maps with n edges.
- Coefficients of a special case of Poisson-Charlier polynomials.A046716
Coefficients of a special case of Poisson-Charlier polynomials.
- a(n) = 2*a(n-1) + 3*a(n-2), a(0) = a(1) = 1.A046717
a(n) = 2*a(n-1) + 3*a(n-2), a(0) = a(1) = 1.
- Number of permutations of [ n ] with exactly one 132-pattern and two 123-patterns.A046718
Number of permutations of [ n ] with exactly one 132-pattern and two 123-patterns.
- Total number of digits in all primes with n digits.A046719
Total number of digits in all primes with n digits.
- Subsequence of beastly primes (A186086) that are palindromes that begin and end with 7.A046720
Subsequence of beastly primes (A186086) that are palindromes that begin and end with 7.
- Number of semi-meanders of order n with 2 components.A046721
Number of semi-meanders of order n with 2 components.
- Number of semi-meanders of order n with 3 components.A046722
Number of semi-meanders of order n with 3 components.
- Number of semi-meanders of order n with 4 components.A046723
Number of semi-meanders of order n with 4 components.
- Number of semi-meanders of order n with 5 components.A046724
Number of semi-meanders of order n with 5 components.
- Number of semi-meanders of order n with 6 components.A046725
Number of semi-meanders of order n with 6 components.
- Triangle of numbers of semi-meanders of order n with k components.A046726
Triangle of numbers of semi-meanders of order n with k components.
- Related to Pythagorean triples: alternate terms of A001652 and A046090.A046727
Related to Pythagorean triples: alternate terms of A001652 and A046090.
- Let p1, p2 be first pair of consecutive primes with difference 2n; let p3, p4 be 2nd such pair; sequence gives "wadi" value p3-p1.A046728
Let p1, p2 be first pair of consecutive primes with difference 2n; let p3, p4 be 2nd such pair; sequence gives "wadi" value p3-p1.
- Expansion of 4*x/((1+x)*(1-6*x+x^2)).A046729
Expansion of 4*x/((1+x)*(1-6*x+x^2)).
- a(n) = A002172(n) / 2.A046730
a(n) = A002172(n) / 2.
- a(n) = sum of primes < 10^n.A046731
a(n) = sum of primes < 10^n.
- "Norep emirps": primes with distinct digits which remain prime when reversed.A046732
"Norep emirps": primes with distinct digits which remain prime when reversed.
- Periods for divisibility of A000213 by n.A046733
Periods for divisibility of A000213 by n.
- Period of A000213 mod n.A046734
Period of A000213 mod n.
- Nontrivial (i.e., having no nontrivial factors with this property) integers which do not divide any terms of A000213.A046735
Nontrivial (i.e., having no nontrivial factors with this property) integers which do not divide any terms of A000213.
- Number of ways to place non-intersecting diagonals in convex n-gon so as to create no triangles.A046736
Number of ways to place non-intersecting diagonals in convex n-gon so as to create no triangles.
- Reduced period of A000073 mod n.A046737
Reduced period of A000073 mod n.
- Period of Fibonacci 3-step sequence A000073 mod n.A046738
Period of Fibonacci 3-step sequence A000073 mod n.
- Triangle read by rows, related to number of permutations of [n] with 0 successions and k rises.A046739
Triangle read by rows, related to number of permutations of [n] with 0 successions and k rises.
- Triangle of number of permutations of [n] with 0 successions, by number of rises.A046740
Triangle of number of permutations of [n] with 0 successions, by number of rises.
- Triangle read by rows giving number of arrangements of k dumbbells on 2 X n grid (n >= 0, k >= 0).A046741
Triangle read by rows giving number of arrangements of k dumbbells on 2 X n grid (n >= 0, k >= 0).
- Triangle of number of connected graphs with k >= 1 edges and n nodes (2 <= n <= k+1).A046742
Triangle of number of connected graphs with k >= 1 edges and n nodes (2 <= n <= k+1).
- Erroneous version of A001393.A046743
Erroneous version of A001393.
- Erroneous version of A000186.A046744
Erroneous version of A000186.
- Number of connected graphs with <= n edges.A046745
Number of connected graphs with <= n edges.
- Sum of smallest parts of all partitions of n.A046746
Sum of smallest parts of all partitions of n.
- Number of n X n rational {0,1}-matrices of determinant 0.A046747
Number of n X n rational {0,1}-matrices of determinant 0.
- Row sums of triangle A046521.A046748
Row sums of triangle A046521.
- Number of pure periods of length n for splitting games.A046749
Number of pure periods of length n for splitting games.
- Erroneous version of A000088.A046750
Erroneous version of A000088.
- Triangle read by rows of number of connected graphs with n nodes and k edges (n >= 2, 1 <= k <= n(n-1)/2).A046751
Triangle read by rows of number of connected graphs with n nodes and k edges (n >= 2, 1 <= k <= n(n-1)/2).
- Triangle read by rows: T(n,k) is the number of unlabeled nonseparable (or 2-connected) loopless multigraphs with n edges on k nodes and degree >= 3 at each node, n >= 3, 2 <= k <= floor(2*n/3).A046752
Triangle read by rows: T(n,k) is the number of unlabeled nonseparable (or 2-connected) loopless multigraphs with n edges on k nodes and degree >= 3 at each node, n >= 3, 2 <= k <= floor(2*n/3).
- Prime factors of |numerator(B(2n))| which are >= 2n+3.A046753
Prime factors of |numerator(B(2n))| which are >= 2n+3.
- Numbers k such that the square of d(k) (number of divisors) divides k.A046754
Numbers k such that the square of d(k) (number of divisors) divides k.
- Numbers k such that d(k)^3 divides k.A046755
Numbers k such that d(k)^3 divides k.
- Numbers k such that d(k)^4 divides k.A046756
Numbers k such that d(k)^4 divides k.
- Triangle of coefficients of certain polynomials (exponents in decreasing order).A046757
Triangle of coefficients of certain polynomials (exponents in decreasing order).
- Equidigital numbers.A046758
Equidigital numbers.
- Economical numbers: write n as a product of primes raised to powers, let D(n) = number of digits in product, l(n) = number of digits in n; sequence gives n such that D(n) < l(n).A046759
Economical numbers: write n as a product of primes raised to powers, let D(n) = number of digits in product, l(n) = number of digits in n; sequence gives n such that D(n) < l(n).
- Wasteful numbers.A046760
Wasteful numbers.