login
This site is supported by donations to The OEIS Foundation.

 

Logo

The October issue of the Notices of the Amer. Math. Soc. has an article about the OEIS.

Hints
(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. 23
0, 2, 7, 57, 182, 1068, 1068, 32318, 110443, 280182, 3626068, 23157318, 120813568, 123327057, 1097376068, 11109655182, 49925501068, 355101282318, 355101282318, 3459595983307, 15613890344818, 110981321985443 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Moshe Levin, Table of n, a(n) for n = 0..100

FORMULA

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

MATHEMATICA

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 *)

Table[x/.FindInstance[Mod[x^2+1, 5^n]==0, x, Integers][[1]], {n, 0, 25}] (* Harvey P. Dale, Jul 04 2017 *)

PROG

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

CROSSREFS

Cf. A034935, A199206.

Sequence in context: A304984 A002658 A175818 * A048898 A034935 A294948

Adjacent sequences:  A034936 A034937 A034938 * A034940 A034941 A034942

KEYWORD

nonn,nice,easy

AUTHOR

N. J. A. Sloane.

EXTENSIONS

More terms from Michael Somos

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 22 19:01 EDT 2018. Contains 315270 sequences. (Running on oeis4.)