Sequences
392,541 sequences
- Solutions (value of x) of Diophantine equation 2*x^2 + 3*x + 2 = r^2.A056161
Solutions (value of x) of Diophantine equation 2*x^2 + 3*x + 2 = r^2.
- a(n) = Sum_{k=0..n} (k!)^(n-k).A056162
a(n) = Sum_{k=0..n} (k!)^(n-k).
- Number of ordered antichains on an unlabeled n-set; labeled T_1-hypergraphs with n hyperedges.A056163
Number of ordered antichains on an unlabeled n-set; labeled T_1-hypergraphs with n hyperedges.
- Number of ordered antichain covers of an unlabeled n-set; labeled T_1-hypergraphs (without empty hyperedges) with n hyperedges.A056164
Number of ordered antichain covers of an unlabeled n-set; labeled T_1-hypergraphs (without empty hyperedges) with n hyperedges.
- e^[e^[e^ ... [e^0] ... ]], n high, where [] is "floor".A056165
e^[e^[e^ ... [e^0] ... ]], n high, where [] is "floor".
- Numbers which are the product of distinct primes raised to prime powers.A056166
Numbers which are the product of distinct primes raised to prime powers.
- Numbers k such that k! is not divisible by the square of (f+1)!, where f = floor(k/2).A056167
Numbers k such that k! is not divisible by the square of (f+1)!, where f = floor(k/2).
- Duplicate of A054041.A056168
Duplicate of A054041.
- Number of unitary prime divisors of n.A056169
Number of unitary prime divisors of n.
- Number of non-unitary prime divisors of n.A056170
Number of non-unitary prime divisors of n.
- a(n) = pi(n) - pi(floor(n/2)), where pi is A000720.A056171
a(n) = pi(n) - pi(floor(n/2)), where pi is A000720.
- Number of non-unitary prime divisors of n!.A056172
Number of non-unitary prime divisors of n!.
- Number of unitary prime divisors of central binomial coefficient C(n, floor(n/2)) (A001405).A056173
Number of unitary prime divisors of central binomial coefficient C(n, floor(n/2)) (A001405).
- Number of non-monotone maps from 1,...,n to 1,...,n.A056174
Number of non-monotone maps from 1,...,n to 1,...,n.
- Number of nonunitary prime divisors of the central binomial coefficient C(n, floor(n/2)) (A001405).A056175
Number of nonunitary prime divisors of the central binomial coefficient C(n, floor(n/2)) (A001405).
- Sum of a(n) terms of 1/k^(1/4) first exceeds n.A056176
Sum of a(n) terms of 1/k^(1/4) first exceeds n.
- Sum of a(n) terms of 1/k^(1/5) first exceeds n.A056177
Sum of a(n) terms of 1/k^(1/5) first exceeds n.
- Sum of a(n) terms of 1/k^(2/3) first exceeds n.A056178
Sum of a(n) terms of 1/k^(2/3) first exceeds n.
- Sum of a(n) terms of 1/k^(3/4) first exceeds n.A056179
Sum of a(n) terms of 1/k^(3/4) first exceeds n.
- Sum of a(n) terms of 1/k^(4/5) first exceeds n.A056180
Sum of a(n) terms of 1/k^(4/5) first exceeds n.
- Sum of a(n) terms of 1/k^(5/6) first exceeds n.A056181
Sum of a(n) terms of 1/k^(5/6) first exceeds n.
- First differences of A003063.A056182
First differences of A003063.
- Sum of a(n) terms of 1/k^(6/7) first exceeds n.A056183
Sum of a(n) terms of 1/k^(6/7) first exceeds n.
- Sum of a(n) terms of 1/k^(7/8) first exceeds n.A056184
Sum of a(n) terms of 1/k^(7/8) first exceeds n.
- Sum of a(n) terms of 1/k^(8/9) first exceeds n.A056185
Sum of a(n) terms of 1/k^(8/9) first exceeds n.
- Sum of a(n) terms of 1/k^(9/10) first exceeds n.A056186
Sum of a(n) terms of 1/k^(9/10) first exceeds n.
- Least prime factor of n^n + (n+1)^(n+1).A056187
Least prime factor of n^n + (n+1)^(n+1).
- a(1) = 1; for n>1, sum of binomial(n,k) as k runs over RRS(n), the reduced residue system of n.A056188
a(1) = 1; for n>1, sum of binomial(n,k) as k runs over RRS(n), the reduced residue system of n.
- a(n) = 2^n - A056188(n).A056189
a(n) = 2^n - A056188(n).
- a(n) = Sum_{d|n and gcd(d, n/d)=1} binomial(n,d).A056190
a(n) = Sum_{d|n and gcd(d, n/d)=1} binomial(n,d).
- Characteristic cube divisor of n: cube of g = gcd(K,F), where K is the largest square root divisor of n (A000188) and F = n/(K*K) = A007913(n) is its squarefree part; g^2 divides K^2 = A008833(n) = g^2*L^2 and g divides F = gf.A056191
Characteristic cube divisor of n: cube of g = gcd(K,F), where K is the largest square root divisor of n (A000188) and F = n/(K*K) = A007913(n) is its squarefree part; g^2 divides K^2 = A008833(n) = g^2*L^2 and g divides F = gf.
- a(n) = n divided by its characteristic cube divisor A056191.A056192
a(n) = n divided by its characteristic cube divisor A056191.
- Goodstein sequence starting with 4: to calculate a(n+1), write a(n) in the hereditary representation in base n+2, then bump the base to n+3, then subtract 1.A056193
Goodstein sequence starting with 4: to calculate a(n+1), write a(n) in the hereditary representation in base n+2, then bump the base to n+3, then subtract 1.
- Characteristic cube divisor of n!: a(n) = A056191(n!).A056194
Characteristic cube divisor of n!: a(n) = A056191(n!).
- a(n) = n! divided by its characteristic cube divisor A056194.A056195
a(n) = n! divided by its characteristic cube divisor A056194.
- Numbers n such that A055229(n) = 2.A056196
Numbers n such that A055229(n) = 2.
- Diagonal of A056151.A056197
Diagonal of A056151.
- Defined by Product 1/(1-x^k)^a_k, k=1..infinity = 1+x+2*Sum(a_k*x^k, k=2..infinity).A056198
Defined by Product 1/(1-x^k)^a_k, k=1..infinity = 1+x+2*Sum(a_k*x^k, k=2..infinity).
- a(n) = n * a(n-1) - Sum_{k=1..n-2} a(k) with a(1) = 0 and a(2) = 1.A056199
a(n) = n * a(n-1) - Sum_{k=1..n-2} a(k) with a(1) = 0 and a(2) = 1.
- a(n) = 2^n - A056045(n).A056200
a(n) = 2^n - A056045(n).
- Characteristic cube divisor (A056191) of central binomial coefficient (A001405).A056201
Characteristic cube divisor (A056191) of central binomial coefficient (A001405).
- Central binomial coefficient A001405(n) divided by its characteristic cube divisor A056201(n).A056202
Central binomial coefficient A001405(n) divided by its characteristic cube divisor A056201(n).
- Triangle of numbers related to congruum problem: T(n,k)=n^2+2nk-k^2 with n>k>0, starting at T(2,1)=7.A056203
Triangle of numbers related to congruum problem: T(n,k)=n^2+2nk-k^2 with n>k>0, starting at T(2,1)=7.
- Number of n X 5 binary matrices under row and column permutations and column complementations.A056204
Number of n X 5 binary matrices under row and column permutations and column complementations.
- Number of n X 6 binary matrices under row and column permutations and column complementations.A056205
Number of n X 6 binary matrices under row and column permutations and column complementations.
- Smallest prime p such that p + 2^n is also a prime.A056206
Smallest prime p such that p + 2^n is also a prime.
- Number of binary trees of height <= n.A056207
Number of binary trees of height <= n.
- Primes p+2^n arising in A056206.A056208
Primes p+2^n arising in A056206.
- Duplicate of A056157.A056209
Duplicate of A056157.
- Primes p whose period of reciprocal equals (p-1)/5.A056210
Primes p whose period of reciprocal equals (p-1)/5.