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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A218712 a(n) is smallest number such that a(n)^2 + 1 is divisible by 29^n. 8
0, 12, 41, 10133, 34522, 7745569, 253879357, 7986582530, 61012922706, 4563230639355, 67972499239990, 1330094199140593, 47471944863682723, 5000878909740249297, 5000878909740249297, 590115586441858677665, 77072583141941801290876, 423420364218752896284166 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..17.

EXAMPLE

a(4) = 34522 because 34522^2+1 = 5 * 29 ^ 4 * 337.

MATHEMATICA

b=12; n29=29; jo=Join[{0, b}, Table[n29=29*n29; b=PowerMod[b, 29, n29]; b=Min[b, n29-b], {99}]]

CROSSREFS

Cf. A002522, A049532, A034939, A218709, A218710.

Sequence in context: A251429 A114072 A244793 * A022672 A287152 A109275

Adjacent sequences: A218709 A218710 A218711 * A218713 A218714 A218715

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 31 01:17 EST 2023. Contains 359947 sequences. (Running on oeis4.)