This site is supported by donations to The OEIS Foundation.



Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 4500 articles have referenced us, often saying "we would not have discovered this result without the OEIS".

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A034939 a(n) is smallest number such that a(n)^2 + 1 is divisible by 5^n. 22


%S 0,2,7,57,182,1068,1068,32318,110443,280182,3626068,23157318,

%T 120813568,123327057,1097376068,11109655182,49925501068,355101282318,

%U 355101282318,3459595983307,15613890344818,110981321985443

%N a(n) is smallest number such that a(n)^2 + 1 is divisible by 5^n.

%H Moshe Levin, <a href="/A034939/b034939.txt">Table of n, a(n) for n = 0..100</a>

%F a(n) = min(A048898(n), A048899(n)).

%t b=2; n5=5; jo=Join[{0,b}, Table[n5=5*n5; b=PowerMod[b,5,n5]; b=Min[b,n5-b], {99}]] (* _Moshe Levin_, Nov 04 2011 *)

%o (PARI) b(n)=if(n<2,2,b(n-1)^5)%5^n; a(n)=min(b(n),5^n-b(n))

%Y Cf. A034935, A199206.

%K nonn,nice,easy

%O 0,2

%A _N. J. A. Sloane_.

%E More terms from _Michael Somos_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified November 30 21:07 EST 2015. Contains 264673 sequences.