Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Jan 12 2019 12:59:53
%S 41,1681,2963603,19477970573,203586339651833,2677331022258108347,
%T 40785586686127252393,3817838920923578492820563,
%U 22427952844519540079208409331,3292526219739666997778171798741,59254464597252454704406353071130683,93363909561408736238900593787191180421
%N a(n) is the smallest value of Euler polynomial x^2 + x + 41 which is divisible by 41^n.
%C For values x see A147520 For values (x^2 + x + 41)/(41^n) see A147522.
%t a = {}; Do[x = 0; While[Mod[x^2 + x + 41, 41^n] != 0, x++ ]; AppendTo[a,x^2 + x + 41];Print[{n, x, x^2 + x + 41, (x^2 + x + 41)/41^n}], {n, 1, 6}];a
%Y Cf. A145292, A145293, A145294, A147520, A147521, A147522.
%K nonn
%O 1,1
%A _Artur Jasinski_, Nov 06 2008
%E a(7)-a(12) from _Hugo Pfoertner_, Jan 12 2019