312129649

Appears in sequences

• Bessel polynomial y_n(-2).at n=8A002119
• Denominators of convergents to e.at n=22A007677
• Square array read by antidiagonals of T(n,k)=(4k-2)*T(n,k-1)+T(n,k-2) with T(n,0)=1 and T(n,1)=n.at n=46A079166
• Greedy frac multiples of e: a(1)=1, Sum_{n>0} frac(a(n)*e)=1.at n=22A079939
• a(3n) = a(3n-1) + a(3n-2), a(3n+1) = 2n*a(3n) + a(3n-1), a(3n+2) = a(3n+1) + a(3n).at n=24A113874
• Number triangle with row sums given by quadruple factorial numbers A001813.at n=36A168422
• a(n) = (n+7)*a(n-1) + (n-1)*a(n-2), a(-1)=0, a(0)=1.at n=8A176734
• Least splitter of n-th and (n+1)st partial sums of 1/0! + 1/1! + ... + 1/n! + ... = e.at n=17A227777
• Denominators of the other-side convergents to e.at n=21A259588
• Numbers k such that there exists at least an integer in the interval [e*k - 1/k, e*k + 1/k] where e = 2.71828... is Euler's number.at n=32A265742
• Denominator of a sequence of fractions converging to e.at n=14A340738
• Triangle read by rows: T(n,k) is the number of pairs (c,m), where c is a covering of the 1 X (2n) grid with 1 X 2 rectangles and equal numbers of red and blue 1 X 1 squares and m is a matching between red squares and blue squares, such that exactly k matched pairs are adjacent.at n=36A360441
• a(n) is the n-digit denominator of the fraction h/k with h and k coprime positive integers at which abs(h/k-e) is minimal.at n=8A368621