Sequences
392,541 sequences
- Smallest integer that can be expressed as the sum of n squares of positive integers in exactly n distinct ways, or 0 if no such number exists.A052261
Smallest integer that can be expressed as the sum of n squares of positive integers in exactly n distinct ways, or 0 if no such number exists.
- Partial sums of A014824.A052262
Partial sums of A014824.
- Number of 5-colored labeled graphs on n nodes (divided by 1024).A052263
Number of 5-colored labeled graphs on n nodes (divided by 1024).
- Number of 5 X n binary matrices up to row and column permutations.A052264
Number of 5 X n binary matrices up to row and column permutations.
- Triangle giving T(n,r) = number of equivalence classes of Boolean functions of n variables and range r=0..2^n under action of symmetric group.A052265
Triangle giving T(n,r) = number of equivalence classes of Boolean functions of n variables and range r=0..2^n under action of symmetric group.
- Number of 3 X n matrices over GF(3) under row and column permutations.A052266
Number of 3 X n matrices over GF(3) under row and column permutations.
- Number of 2 X n matrices over GF(3) under row and column permutations.A052267
Number of 2 X n matrices over GF(3) under row and column permutations.
- First differences of 10^n (A011557).A052268
First differences of 10^n (A011557).
- Number of n X n matrices over GF(3) up to row and column permutations.A052269
Number of n X n matrices over GF(3) up to row and column permutations.
- Consider a room of size r X s where rs = 2n and 1 <= r <= s; count ways to arrange n Tatami mats in room; a(n) = total number of ways for all choices of r and s. Two arrangements are considered the same if one is a rotation or reflection of the other.A052270
Consider a room of size r X s where rs = 2n and 1 <= r <= s; count ways to arrange n Tatami mats in room; a(n) = total number of ways for all choices of r and s. Two arrangements are considered the same if one is a rotation or reflection of the other.
- Number of n X n matrices over GF(4) under row and column permutations.A052271
Number of n X n matrices over GF(4) under row and column permutations.
- Number of n X n matrices over GF(5) under row and column permutations.A052272
Number of n X n matrices over GF(5) under row and column permutations.
- Number of distinct 4th powers mod n.A052273
Number of distinct 4th powers mod n.
- Number of distinct 5th powers mod n.A052274
Number of distinct 5th powers mod n.
- Number of distinct 6th powers mod n.A052275
Number of distinct 6th powers mod n.
- Nonnegative numbers of the form n^3 (+/-) 3, n >= 0.A052276
Nonnegative numbers of the form n^3 (+/-) 3, n >= 0.
- a(n) = (4n+2)!/2^(2n+1).A052277
a(n) = (4n+2)!/2^(2n+1).
- a(n) = (4n+3)!/4^n.A052278
a(n) = (4n+3)!/4^n.
- Primes such that the sum of the factorials of the digits is a perfect square.A052279
Primes such that the sum of the factorials of the digits is a perfect square.
- Number of 4 X 4 stochastic matrices under row and column permutations.A052280
Number of 4 X 4 stochastic matrices under row and column permutations.
- Number of 4 X 4 symmetric stochastic matrices under row and column permutations.A052281
Number of 4 X 4 symmetric stochastic matrices under row and column permutations.
- Number of 3 X 3 stochastic matrices under row and column permutations.A052282
Number of 3 X 3 stochastic matrices under row and column permutations.
- Triangle read by rows: T(n,k) is the number of unlabeled directed graphs on n nodes with k arcs, k=0..n*(n-1).A052283
Triangle read by rows: T(n,k) is the number of unlabeled directed graphs on n nodes with k arcs, k=0..n*(n-1).
- Number of compositions of n into nonprime numbers.A052284
Number of compositions of n into nonprime numbers.
- Duplicate of A046858.A052285
Duplicate of A046858.
- Primes p such that f(p) > f(q) for all primes q < p, where f(n) is the sum of factorials of the digits of n if that sum is the square of a prime, otherwise f(n)=0.A052286
Primes p such that f(p) > f(q) for all primes q < p, where f(n) is the sum of factorials of the digits of n if that sum is the square of a prime, otherwise f(n)=0.
- Start with 3; the general rule is "if x is present then so is x*y for every y <= x".A052287
Start with 3; the general rule is "if x is present then so is x*y for every y <= x".
- First differences of the average of two consecutive primes (A024675).A052288
First differences of the average of two consecutive primes (A024675).
- Numbers n such that n!*2^n + n + 1 = A000165(n) + n + 1 is prime.A052289
Numbers n such that n!*2^n + n + 1 = A000165(n) + n + 1 is prime.
- Prime values of n!*2^n+n+1 = A000165(n)+n+1.A052290
Prime values of n!*2^n+n+1 = A000165(n)+n+1.
- Primes p such that 4p^2 + 1 is also prime.A052291
Primes p such that 4p^2 + 1 is also prime.
- Primes of form 4*p^2 + 1, p prime.A052292
Primes of form 4*p^2 + 1, p prime.
- Numbers of the form 11 + x^2 + x or 11 + 2*x^2.A052293
Numbers of the form 11 + x^2 + x or 11 + 2*x^2.
- Pernicious numbers: numbers with a prime number of 1's in their binary expansion.A052294
Pernicious numbers: numbers with a prime number of 1's in their binary expansion.
- a(n) = (n*(n+1)/2)!.A052295
a(n) = (n*(n+1)/2)!.
- Triangle read by rows: T(n,k) = number of labeled digraphs with n nodes and k arcs and without directed paths of length >=2, with 0 <= k <= floor(n^2/4).A052296
Triangle read by rows: T(n,k) = number of labeled digraphs with n nodes and k arcs and without directed paths of length >=2, with 0 <= k <= floor(n^2/4).
- Number of distinct prime factors of all composite numbers between n-th and (n+1)st primes.A052297
Number of distinct prime factors of all composite numbers between n-th and (n+1)st primes.
- Maximal number of distinct prime factors of any composite number between n-th and (n+1)-st primes.A052298
Maximal number of distinct prime factors of any composite number between n-th and (n+1)-st primes.
- Minimal number of distinct prime factors of any composite number between n-th and (n+1)-st primes.A052299
Minimal number of distinct prime factors of any composite number between n-th and (n+1)-st primes.
- Number of rooted Greg trees.A052300
Number of rooted Greg trees.
- Number of asymmetric rooted Greg trees.A052301
Number of asymmetric rooted Greg trees.
- Number of Greg trees with n black nodes.A052302
Number of Greg trees with n black nodes.
- Number of asymmetric Greg trees.A052303
Number of asymmetric Greg trees.
- Number of squares dividing A025487(n).A052304
Number of squares dividing A025487(n).
- Number of semisimple rings with A025487(n) elements: a(n) = A038538(A025487(n)).A052305
Number of semisimple rings with A025487(n) elements: a(n) = A038538(A025487(n)).
- Product of exponents of prime factorization of n by prime signature: A005361(A025487).A052306
Product of exponents of prime factorization of n by prime signature: A005361(A025487).
- Triangle read by rows: T(n,k) = number of bracelets (reversible necklaces) with n beads, k of which are black and n - k are white.A052307
Triangle read by rows: T(n,k) = number of bracelets (reversible necklaces) with n beads, k of which are black and n - k are white.
- Triangle: matrix inverse of A052307.A052308
Triangle: matrix inverse of A052307.
- Column 1 of triangle A052308.A052309
Column 1 of triangle A052308.
- Triangle read by rows: matrix square of A052307.A052310
Triangle read by rows: matrix square of A052307.