118732

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=26A000044
• Number of permutations p(1),...,p(n) of 1,...,n such that gcd(Sum_{k=1..m} p(k), p(m+1)) = 1 for all positive integers m <= n-1.at n=9A076143