Sequences
392,541 sequences
- A class of Boolean functions of n variables and rank 3.A051361
A class of Boolean functions of n variables and rank 3.
- Primes remaining prime if any digit is deleted (zeros allowed).A051362
Primes remaining prime if any digit is deleted (zeros allowed).
- Number of 6-element families of an n-element set such that every 3 members of the family have a nonempty intersection.A051363
Number of 6-element families of an n-element set such that every 3 members of the family have a nonempty intersection.
- Number of 5-element families of an n-element set such that every 3 members of the family have a nonempty intersection.A051364
Number of 5-element families of an n-element set such that every 3 members of the family have a nonempty intersection.
- Number of 4-element families of an n-element set such that every 3 members of the family have a nonempty intersection.A051365
Number of 4-element families of an n-element set such that every 3 members of the family have a nonempty intersection.
- Number of 6-element families of an n-element set such that every 4 members of the family have a nonempty intersection.A051366
Number of 6-element families of an n-element set such that every 4 members of the family have a nonempty intersection.
- Number of 5-element families of an n-element set such that every 4 members of the family have a nonempty intersection.A051367
Number of 5-element families of an n-element set such that every 4 members of the family have a nonempty intersection.
- Number of Boolean functions of n variables and rank 8 from the Post class F(5,2).A051368
Number of Boolean functions of n variables and rank 8 from the Post class F(5,2).
- a(n+1) = a(n) + sum of digits of a(n)^2, with a(1) = 3.A051369
a(n+1) = a(n) + sum of digits of a(n)^2, with a(1) = 3.
- a(n+1) = a(n) + sum of digits of a(n)^2, with a(1) = 8.A051370
a(n+1) = a(n) + sum of digits of a(n)^2, with a(1) = 8.
- a(n+1) = a(n) + sum of digits of a(n)^2, with a(1) = 197.A051371
a(n+1) = a(n) + sum of digits of a(n)^2, with a(1) = 197.
- a(n+1) = a(n) + sum of digits of a(n)^2, with a(1) = 567.A051372
a(n+1) = a(n) + sum of digits of a(n)^2, with a(1) = 567.
- a(n+1) = a(n) + sum of digits of (a(n)^3).A051373
a(n+1) = a(n) + sum of digits of (a(n)^3).
- Numbers not of form n + sum of digits of n^2.A051374
Numbers not of form n + sum of digits of n^2.
- Number of Boolean functions of n variables and rank 3 from Post class F(5,inf).A051375
Number of Boolean functions of n variables and rank 3 from Post class F(5,inf).
- Number of Boolean functions of n variables and rank 4 from Post class F(5,inf).A051376
Number of Boolean functions of n variables and rank 4 from Post class F(5,inf).
- a(1)=1; for n > 1, a(n) = sum of exponential divisors (or e-divisors) of n.A051377
a(1)=1; for n > 1, a(n) = sum of exponential divisors (or e-divisors) of n.
- Sum of (1+e)-divisors of n. Let n = Product_i p(i)^r(i) then (1+e)-sigma(n) = Product_i (1 + Sum_{s|r(i)} p(i)^s).A051378
Sum of (1+e)-divisors of n. Let n = Product_i p(i)^r(i) then (1+e)-sigma(n) = Product_i (1 + Sum_{s|r(i)} p(i)^s).
- Generalized Stirling number triangle of first kind.A051379
Generalized Stirling number triangle of first kind.
- Generalized Stirling number triangle of first kind.A051380
Generalized Stirling number triangle of first kind.
- Number of Boolean functions of n variables from Post class F(5,inf).A051381
Number of Boolean functions of n variables from Post class F(5,inf).
- Numbers k whose base 3 expansion matches (0|1)*(02)?(0|1)* (no more than one "02" allowed in midst of 0's and 1's).A051382
Numbers k whose base 3 expansion matches (0|1)*(02)?(0|1)* (no more than one "02" allowed in midst of 0's and 1's).
- Sum of two (possibly negative) cubes in at least 3 ways.A051383
Sum of two (possibly negative) cubes in at least 3 ways.
- Sum of two (possibly negative) cubes in at least 4 ways.A051384
Sum of two (possibly negative) cubes in at least 4 ways.
- Portuguese linear measures used in the 18th century.A051385
Portuguese linear measures used in the 18th century.
- Numbers whose 4th power is the sum of two positive cubes.A051386
Numbers whose 4th power is the sum of two positive cubes.
- Numbers whose 4th power is the sum of two positive cubes in a nontrivial way.A051387
Numbers whose 4th power is the sum of two positive cubes in a nontrivial way.
- Numbers whose 4th power can be expressed as the sum of two positive cubes in more than one way.A051388
Numbers whose 4th power can be expressed as the sum of two positive cubes in more than one way.
- Number of resistance values that can be constructed using exactly n 1-ohm resistors in series or parallel but not with fewer resistors.A051389
Number of resistance values that can be constructed using exactly n 1-ohm resistors in series or parallel but not with fewer resistors.
- Number of nonisomorphic Steiner quadruple systems (SQS's) of order n.A051390
Number of nonisomorphic Steiner quadruple systems (SQS's) of order n.
- Number of nonisomorphic Steiner triple systems (STS's) S(2,3,v) on v = 6n+1 or 6n+3 points.A051391
Number of nonisomorphic Steiner triple systems (STS's) S(2,3,v) on v = 6n+1 or 6n+3 points.
- First differences of A052006.A051392
First differences of A052006.
- Numbers whose square is expressible as the difference of positive cubes in more than one way.A051393
Numbers whose square is expressible as the difference of positive cubes in more than one way.
- Numbers whose 5th power is expressible as the sum of two positive cubes.A051394
Numbers whose 5th power is expressible as the sum of two positive cubes.
- Numbers whose square is a sum of 4 consecutive primes.A051395
Numbers whose square is a sum of 4 consecutive primes.
- a(n) = (2*n-2)*(2*n-3)*a(n-1)+1.A051396
a(n) = (2*n-2)*(2*n-3)*a(n-1)+1.
- a(n) = (2*n-2)*(2*n-1)*a(n-1)+1.A051397
a(n) = (2*n-2)*(2*n-1)*a(n-1)+1.
- a(n) = -(n-3)*a(n-1) + 2*(n-2)^2.A051398
a(n) = -(n-3)*a(n-1) + 2*(n-2)^2.
- a(n) = (n-1)!*a(n-1)+1.A051399
a(n) = (n-1)!*a(n-1)+1.
- Smallest value of x such that M(x) = n, where M() is Mertens's function A002321.A051400
Smallest value of x such that M(x) = n, where M() is Mertens's function A002321.
- Smallest value of x such that M(x) = -n, where M(x) is Mertens's function A002321.A051401
Smallest value of x such that M(x) = -n, where M(x) is Mertens's function A002321.
- Inverse Mertens function: smallest k such that |M(k)| = n, where M(x) is Mertens's function A002321.A051402
Inverse Mertens function: smallest k such that |M(k)| = n, where M(x) is Mertens's function A002321.
- a(n) = (n+2)*(a(n-1) - a(n-2)), starting with a(-1)=0 and a(0)=1.A051403
a(n) = (n+2)*(a(n-1) - a(n-2)), starting with a(-1)=0 and a(0)=1.
- Numbers k such that neither 4 nor 9 divides binomial(2k-1,k) (almost certainly finite).A051404
Numbers k such that neither 4 nor 9 divides binomial(2k-1,k) (almost certainly finite).
- a(n) = (3^n+1)*(3^(n+1)+1)/4.A051405
a(n) = (3^n+1)*(3^(n+1)+1)/4.
- a(n) = (3^n+1) * (3^(n+1)+1) / 8.A051406
a(n) = (3^n+1) * (3^(n+1)+1) / 8.
- a(n) = 3^n*(3^(n+1)+1)/2.A051407
a(n) = 3^n*(3^(n+1)+1)/2.
- a(n+1) = a(n) + sum of digits of (a(n)^3).A051408
a(n+1) = a(n) + sum of digits of (a(n)^3).
- a(n+1) = a(n) + sum of digits of (a(n)^3).A051409
a(n+1) = a(n) + sum of digits of (a(n)^3).
- a(n+1) = a(n) + sum of digits of a(n)^3.A051410
a(n+1) = a(n) + sum of digits of a(n)^3.