203835545219domain: NAppears in sequencesa(n+1) is the smallest prime > a(n) such that a(n+1) == a(n-1) (mod a(n)).at n=15A072999a(1) = 1, a(2) = 2, for n >= 3, a(n) = smallest prime > a(n-1) such that a(n) mod a(n-1) = a(n-2).at n=16A175093