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 #4 Nov 05 2012 12:18:07
%S 0,5,70,239,239,143044,1999509,6826318,6826318,822557039,52199939826,
%T 603633907222,11356596271444,11356596271444,1828607235824962,
%U 13920898306972194,13920898306972194,2675587335039691558,49226908181248336040,513050126578538629605
%N a(n) is smallest number such that a(n)^2 + 1 is divisible by 13^n.
%e a(4) = 239 because 239^2+1 = 2*13^4.
%t b=5;n13=13;jo=Join[{0,b},Table[n13=13*n13;b=PowerMod[b,13,n13];b=Min[b,n13-b],{99}]]
%Y Cf. A002522, A049532, A034939.
%K nonn
%O 0,2
%A _Michel Lagneau_, Nov 04 2012