139563domain: NAppears in sequencesa(n) = Smallest number x such that Euler Polynomial x^2 + x + 41 is divisible by 41^n.at n=3A147520Smallest nonnegative number x such that x^2 + x + 41 has exactly n prime factors counting multiplicities.at n=5A228122