45416

Appears in sequences

• Least term in period of continued fraction for sqrt(n) is 9.at n=30A031433
• E.g.f. exp( x^2 * exp(x) ).at n=8A216507
• Number of nondecreasing -2..2 vectors of length n whose dot product with some other -2..2 vector equals n.at n=29A226334
• Least k such that primorial(n) divides binomial(2k,k).at n=36A267823
• Least k such that primorial(n) divides binomial(2k,k).at n=37A267823
• Least k such that primorial(n) divides binomial(2k,k).at n=38A267823
• Least k such that primorial(n) divides binomial(2k,k).at n=39A267823
• Least k such that primorial(n) divides binomial(2k,k).at n=40A267823
• Least k such that primorial(n) divides binomial(2k,k).at n=41A267823
• Least k such that primorial(n) divides binomial(2k,k).at n=42A267823
• E.g.f.: exp(x^2 * exp(-x)).at n=8A292907
• Square array T(n,k), n>=0, k>=0, read by antidiagonals, where T(0,k) = 1 and T(n,k) = (-1)^(k+1) * k! * Sum_{i=0..n-1} (-1)^i * binomial(n-1,i) * binomial(i+1,k) * T(n-1-i,k) for n > 0.at n=63A292973
• Square array T(n,k), n>=0, k>=0, read by antidiagonals, where T(0,k) = 1 and T(n,k) = k! * Sum_{i=0..n-1} binomial(n-1,i) * binomial(i+1,k) * T(n-1-i,k) for n > 0.at n=63A292978
• a(n) = binomial(n+3, 4) + binomial(n+1, 3) + 1.at n=30A368881
• a(n) = Sum_{k=0..n} (k+1) * binomial(2*k,2*n-2*k).at n=10A381421