Sequences
392,541 sequences
- Number of sets of lists with distinct list sizes, cf. A000262.A088311
Number of sets of lists with distinct list sizes, cf. A000262.
- Number of sets of lists (cf. A000262) with even number of lists.A088312
Number of sets of lists (cf. A000262) with even number of lists.
- Number of "sets of lists" (cf. A000262) with an odd number of lists.A088313
Number of "sets of lists" (cf. A000262) with an odd number of lists.
- Cardinality of set of sets of parts of all partitions of n.A088314
Cardinality of set of sets of parts of all partitions of n.
- For n such that all numbers between the largest prime preceding n! and the smallest prime following n! + n are composite (see A088331), sequence is number of such consecutive composite numbers.A088315
For n such that all numbers between the largest prime preceding n! and the smallest prime following n! + n are composite (see A088331), sequence is number of such consecutive composite numbers.
- a(n) = 13*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 13.A088316
a(n) = 13*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 13.
- a(n) = 8*a(n-1) + a(n-2), starting with a(0) = 1 and a(1) = 4.A088317
a(n) = 8*a(n-1) + a(n-2), starting with a(0) = 1 and a(1) = 4.
- The number of possible values of the squarefree kernel (A007947) shared by at least two solutions x to A056239(x) = n.A088318
The number of possible values of the squarefree kernel (A007947) shared by at least two solutions x to A056239(x) = n.
- Ordered hypotenuses of primitive Pythagorean triangles having legs that add up to a square.A088319
Ordered hypotenuses of primitive Pythagorean triangles having legs that add up to a square.
- a(n) = 10*a(n-1) + a(n-2), starting with a(0) = 1 and a(1) = 5.A088320
a(n) = 10*a(n-1) + a(n-2), starting with a(0) = 1 and a(1) = 5.
- Duplicate of A061301.A088321
Duplicate of A061301.
- Number of monotone functions f: 2^X -> 2^X where 2^X is the power set of an n-set X. Here f is monotone means that if A is a subset of B then f(A) is a subset of f(B).A088322
Number of monotone functions f: 2^X -> 2^X where 2^X is the power set of an n-set X. Here f is monotone means that if A is a subset of B then f(A) is a subset of f(B).
- Number of numbers b>1 such that n is a repunit in base b representation.A088323
Number of numbers b>1 such that n is a repunit in base b representation.
- Smallest prime formed by a substring of the decimal digits of 1/n beginning with the first (nonzero) digit after the decimal point, or 0 if no such prime exists.A088324
Smallest prime formed by a substring of the decimal digits of 1/n beginning with the first (nonzero) digit after the decimal point, or 0 if no such prime exists.
- Piet Hut's "coat-hanger" sequence: unlabeled forests of rooted trees with n edges, where there can be any number of components, the outdegree of each node is <= 2 and the symmetric group acts on the components.A088325
Piet Hut's "coat-hanger" sequence: unlabeled forests of rooted trees with n edges, where there can be any number of components, the outdegree of each node is <= 2 and the symmetric group acts on the components.
- Triangle T(n,k) (n>=1, 1<=k<=n) read by rows, giving number of Piet Hut's "coat-hanger" arrangements: unlabeled forests of rooted trees with n edges and k connected components, in which the outdegree of each node is <= 2 and the symmetric group acts on the components.A088326
Triangle T(n,k) (n>=1, 1<=k<=n) read by rows, giving number of Piet Hut's "coat-hanger" arrangements: unlabeled forests of rooted trees with n edges and k connected components, in which the outdegree of each node is <= 2 and the symmetric group acts on the components.
- G.f.: exp(Sum_{k>=1} B(x^k)/k), where B(x) = x + 2*x^2 + 5*x^3 + 14*x^4 + 42*x^5 + ... = (C(x)-1)/x and C is the g.f. for the Catalan numbers A000108.A088327
G.f.: exp(Sum_{k>=1} B(x^k)/k), where B(x) = x + 2*x^2 + 5*x^3 + 14*x^4 + 42*x^5 + ... = (C(x)-1)/x and C is the g.f. for the Catalan numbers A000108.
- Table read by rows where row n contains lower twin primes of the form k*A002110(n)-1 in the range 0 < k < A006094(n+1).A088328
Table read by rows where row n contains lower twin primes of the form k*A002110(n)-1 in the range 0 < k < A006094(n+1).
- Table read by rows where row n consists of all k in the range 0<k < A006094(n+1) such that k*A002110(n)-1 are lower twin primes.A088329
Table read by rows where row n consists of all k in the range 0<k < A006094(n+1) such that k*A002110(n)-1 are lower twin primes.
- Sum of the remainders when n is divided by nonzero numbers obtained by deleting one digit. The sum ranges over all the digits.A088330
Sum of the remainders when n is divided by nonzero numbers obtained by deleting one digit. The sum ranges over all the digits.
- Numbers n such that all numbers between the largest prime preceding n! and the smallest prime following n! + n are composite.A088331
Numbers n such that all numbers between the largest prime preceding n! and the smallest prime following n! + n are composite.
- Primes of the form k! + 1.A088332
Primes of the form k! + 1.
- A version of Josephus problem: a(n) is the surviving integer under the following elimination process. Arrange 1,2,3,...,n in a circle, increasing clockwise. Starting with i=1, delete the integer 3 places clockwise from i. Repeat, counting 3 places from the next undeleted integer, until only one integer remains.A088333
A version of Josephus problem: a(n) is the surviving integer under the following elimination process. Arrange 1,2,3,...,n in a circle, increasing clockwise. Starting with i=1, delete the integer 3 places clockwise from i. Repeat, counting 3 places from the next undeleted integer, until only one integer remains.
- Expansion of 1/phi (phi being the golden ratio) as an infinite product: 1/phi = Product_{k=0..n} (1-1/a(k)).A088334
Expansion of 1/phi (phi being the golden ratio) as an infinite product: 1/phi = Product_{k=0..n} (1-1/a(k)).
- Number of permutations in the symmetric group S_n such that the size of their centralizer is even.A088335
Number of permutations in the symmetric group S_n such that the size of their centralizer is even.
- Number of permutations in the symmetric group S_n that have even number of transpositions in their cycle decomposition.A088336
Number of permutations in the symmetric group S_n that have even number of transpositions in their cycle decomposition.
- Self-inverse integer permutation induced by A088230.A088337
Self-inverse integer permutation induced by A088230.
- Numbers n such that frac(x^n)=frac(x*frac(x^(n-1))) where x=3/2 and frac(x) denotes the fractional part of x.A088338
Numbers n such that frac(x^n)=frac(x*frac(x^(n-1))) where x=3/2 and frac(x) denotes the fractional part of x.
- Numbers n such that n multiplied by (the 9's complement of n) + 1 is a prime. If n has d digits then 9's complement of n is 10^d -(n+1).A088339
Numbers n such that n multiplied by (the 9's complement of n) + 1 is a prime. If n has d digits then 9's complement of n is 10^d -(n+1).
- Numbers k such that frac(x^k) = frac(x*frac(x^(k-1))) where x=5/2 and frac(x) denotes the fractional part of x.A088340
Numbers k such that frac(x^k) = frac(x*frac(x^(k-1))) where x=5/2 and frac(x) denotes the fractional part of x.
- Numbers n such that frac(x^n)=frac(x^2*frac(x^(n-2))) where x=3/2 and frac(x) denotes the fractional part of x.A088341
Numbers n such that frac(x^n)=frac(x^2*frac(x^(n-2))) where x=3/2 and frac(x) denotes the fractional part of x.
- Let T = Sum_{k >= 1} k^(k-1)*x^k be the g.f. for rooted labeled trees (A000169); sequence has g.f. T/(1-T).A088342
Let T = Sum_{k >= 1} k^(k-1)*x^k be the g.f. for rooted labeled trees (A000169); sequence has g.f. T/(1-T).
- Records in A069862.A088343
Records in A069862.
- Powers of 3 grouped in pairs of 2 digits.A088344
Powers of 3 grouped in pairs of 2 digits.
- n is divisible by the sum of all divisors of n which are less than the square root of n (values of n where 1 is the only divisor less than sqrt(n) are excluded as trivial cases.).A088345
n is divisible by the sum of all divisors of n which are less than the square root of n (values of n where 1 is the only divisor less than sqrt(n) are excluded as trivial cases.).
- Smallest integer k for which exp(x) > x^n, for all x>=k, n>=3.A088346
Smallest integer k for which exp(x) > x^n, for all x>=k, n>=3.
- This sequence needs a definition.A088347
This sequence needs a definition.
- Primes of the form prime(n) + 2pi(n), where pi is A000720.A088348
Primes of the form prime(n) + 2pi(n), where pi is A000720.
- a(n) = (A085249(n) - 1)/6.A088349
a(n) = (A085249(n) - 1)/6.
- a(n) = (A088349(n)-5)/24.A088350
a(n) = (A088349(n)-5)/24.
- G.f. A(x) satisfies: 1+x = A(xA(2xA(3xA(4xA(...(n*xA(...))))))).A088351
G.f. A(x) satisfies: 1+x = A(xA(2xA(3xA(4xA(...(n*xA(...))))))).
- G.f. = continued fraction: A(x) = 1/(1-x-x^2/(1-x^3-x^4/(1-x^5-x^6/(1-x^7-x^8/(...))))).A088352
G.f. = continued fraction: A(x) = 1/(1-x-x^2/(1-x^3-x^4/(1-x^5-x^6/(1-x^7-x^8/(...))))).
- G.f. = continued fraction: A(x)=1/(1-x-x^2-x^3/(1-x^4-x^5-x^6/(1-x^7-x^8-x^9/(...)))).A088353
G.f. = continued fraction: A(x)=1/(1-x-x^2-x^3/(1-x^4-x^5-x^6/(1-x^7-x^8-x^9/(...)))).
- G.f. = continued fraction: A(x)=1/(1-x-x/(1-x^2-x^2/(1-x^3-x^3/(1-x^4-x^4/(...))))).A088354
G.f. = continued fraction: A(x)=1/(1-x-x/(1-x^2-x^2/(1-x^3-x^3/(1-x^4-x^4/(...))))).
- G.f.: A(x) = 1/(1-x - x/(1-x - x^2/(1-x - x^3/(1-x - x^4/(1-x - x^5/(...)))))), a continued fraction.A088355
G.f.: A(x) = 1/(1-x - x/(1-x - x^2/(1-x - x^3/(1-x - x^4/(1-x - x^5/(...)))))), a continued fraction.
- G.f. = continued fraction: A(x)=1/(1-x^2-x/(1-x^2-x^2/(1-x^2-x^3/(1-x^2-x^4/(...))))).A088356
G.f. = continued fraction: A(x)=1/(1-x^2-x/(1-x^2-x^2/(1-x^2-x^3/(1-x^2-x^4/(...))))).
- G.f. = continued fraction: A(x)=1/(1-x/(1-2*x^2/(1-3*x^3/(1-4*x^4/(...))))).A088357
G.f. = continued fraction: A(x)=1/(1-x/(1-2*x^2/(1-3*x^3/(1-4*x^4/(...))))).
- a(n) equals sum of first n terms of A(x)^n for n>=1, with a(0)=1.A088358
a(n) equals sum of first n terms of A(x)^n for n>=1, with a(0)=1.
- Numbers which occur only once in A004001.A088359
Numbers which occur only once in A004001.
- Duplicate of A057002.A088360
Duplicate of A057002.