34062
domain: N
Appears in sequences
- Expansion of e.g.f.: sech(tanh(x)+log(x+1))=1-4/2!*x^2+6/3!*x^3+77/4!*x^4-340/5!*x^5...at n=7A013128
- Smallest of first string of exactly 2n-1 consecutive composite integers.at n=30A045881
- First subsequent, disjoint occurrence of n consecutive nonprimes.at n=43A060064
- a(n) = A038705(n) - 1.at n=11A143533
- Triangle read by rows: t(n,m) = Sum_{i=0..n} (-1)^(m-i)*Eulerian1(n-i+1, m-i) *Stirling2(n+i+1, i+1), where Eulerian1 are the Eulerian numbers of the first kind (A173018).at n=25A156364
- Triangle read by rows: T(n,k) = number of pairs of partitions of n that have block distance k (n >= 2, 2 <= k <= n).at n=18A193297
- Number of compositions c of n such that no three points (i,c_i), (j,c_j), (k,c_k) are collinear, where c_i denotes the i-th part.at n=23A238686
- Number of partitions of n with difference -1 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=48A242691
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 217", based on the 5-celled von Neumann neighborhood.at n=36A270911
- p-INVERT of A081696, where p(S) = 1 - S - S^2.at n=8A289810
- a(n) is the smallest positive integer that begins a run of exactly 2*n-1 consecutive integers having at least 4 divisors each.at n=30A340735