28237domain: NAppears in sequencesDying rabbits: a(n) = Fibonacci(n) for n <= 12; for n >= 13, a(n) = a(n-1) + a(n-2) - a(n-13).at n=23A107358a(n) = Fibonacci(p) mod p^2, where p = prime(n).at n=41A236395Number of length-4 0..n arrays with no adjacent pair x,x+1 followed at any distance by x+1,x.at n=11A268458