45480

Appears in sequences

• Dying rabbits: a(0) = 1; for 1 <= n <= 12, a(n) = Fibonacci(n); for n >= 13, a(n) = a(n-1) + a(n-2) - a(n-13).at n=24A000044
• Number of ways to write n as an ordered sum of ten powers of 2.at n=21A342254
• Triangle read by rows of partial Bell polynomials B_{n,k}(x_1,...,x_{n-k+1}) evaluated at 2, 2, 12, 72, ..., (n-k)(n-k+1)!, divided by (n-k+1)!, n >= 1, 1 <= k <= n.at n=48A353132
• Number of minimum connected dominating sets in the n-Goldberg graph.at n=7A382384