91380

Appears in sequences

• Least k such that H(k) > n, where H(k) is the harmonic number Sum_{i=1..k} 1/i.at n=12A002387
• Least k such that H(k) >= n, where H(k) is the harmonic number Sum_{i=1..k} 1/i.at n=12A004080
• Numbers k such that if 2 <= j < k then the fractional part of the k-th partial sum of the harmonic series is < the fractional part of the j-th partial sum of the harmonic series.at n=8A004796
• Number of books required for n book-lengths of overhang in the harmonic book stacking problem. Sum_{i=1..a(n)} 1/i >= 2n and Sum_{i=1..a(n)-1} 1/i < 2n.at n=5A014537
• [ exp(9/11)*n! ].at n=7A030939
• a(n) = floor(exp(n - gamma)), where gamma is Euler's constant.at n=12A078141
• Least n such that H(n) is closer to an integer than any H(j) with j < n; where H(n) is the harmonic number sum_{i=0..n} 1/i.at n=10A087460
• a(n) = 1 if a(n-1) is prime, else a(n) = a(n-2)+a(n-3); starting with a(0) = 0, a(1) = a(2) = 1.at n=54A142884
• Least positive integer k such that 1 + 1/2 + ... + 1/k > n/2.at n=23A226161
• Least positive integer k such that 1 + 1/2 + ... + 1/k > n/3.at n=35A226187
• Least positive integer k such that 1 + 1/2 + ... + 1/k > 2n/3.at n=17A226188
• 1 followed by the union of the terms > 2 in A002387 (or A004080) and A115515.at n=22A242654
• Number of length n+1 0..2 arrays with at most one downstep in every n consecutive neighbor pairs.at n=21A255108
• E.g.f. satisfies: A(x) = 1/(1-x)^(A(x)^3).at n=5A264408
• a(n) = n * (7*binomial(n, 2) + 1).at n=30A329530