75001

Appears in sequences

• Apply partial sum operator twice to Fibonacci numbers.at n=21A001924
• a(n) = T(2*n, n+1), T given by A027935.at n=10A027937
• Solution to the Dancing School Problem with n girls and n+2 boys: f(n,2).at n=19A079921
• a(n) = prime(n) * prime(2*n-1).at n=40A219603
• Numbers k such that the decimal representation of k ends that of the sum of the first k cubes.at n=21A301912
• a(n) = Sum_{k = 0..n} (-1)^(n+k)*binomial(n,k)*binomial(n+k,k)*A363983(k).at n=4A363984