The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A218714 a(n) is smallest number such that a(n)^2 + 1 is divisible by 41^n. 6
 0, 9, 378, 11389, 1251967, 46464143, 2363588163, 92615568742, 287369842623, 112076323050317, 2403749863808044, 56094387104417648, 1156752450536914530, 43970228150195457632, 10132163897314954464899, 503212117431217218892992, 19164391897329672149556204 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS EXAMPLE a(3) = 11389 because 11389^2+1 =  2 * 41 ^ 3 * 941. MATHEMATICA b=9; n41=41; jo=Join[{0, b}, Table[n41=41*n41; b=PowerMod[b, 41, n41]; b=Min[b, n41-b], {99}]] CROSSREFS Cf. A002522, A049532, A034939, A218709, A218710, A218712, A218713. Sequence in context: A051848 A238561 A290574 * A157567 A157593 A157602 Adjacent sequences:  A218711 A218712 A218713 * A218715 A218716 A218717 KEYWORD nonn AUTHOR Michel Lagneau, Nov 04 2012 STATUS approved

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

Last modified May 24 04:43 EDT 2022. Contains 354005 sequences. (Running on oeis4.)