45378domain: NAppears in sequencesa(0)=1. a(n) = a(n-1)*(n+1), if n is in the sequence. a(n)= a(n-1) +1, if n is missing from the sequence.at n=27A118471a(0)=a(1)=1, a(n) = least k > a(n-1) such that k*a(n-2) is a Lucas number.at n=7A214915