login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A056087 Numbers n such that n^14 = 1 (mod 15^3). 0
1, 1376, 1999, 3374, 3376, 4751, 5374, 6749, 6751, 8126, 8749, 10124, 10126, 11501, 12124, 13499, 13501, 14876, 15499, 16874, 16876, 18251, 18874, 20249, 20251, 21626, 22249, 23624, 23626, 25001, 25624, 26999, 27001, 28376, 28999, 30374 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..36.

MATHEMATICA

x=15; Select[ Range[ 50000 ], PowerMod[ #, x-1, x^3 ]==1& ]

Select[Range[31000], PowerMod[#, 14, 3375]==1&] (* Harvey P. Dale, Nov 27 2019 *)

CROSSREFS

Sequence in context: A045131 A056049 A206340 * A122692 A076760 A283231

Adjacent sequences:  A056084 A056085 A056086 * A056088 A056089 A056090

KEYWORD

nonn

AUTHOR

Robert G. Wilson v, Jun 08 2000

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 20 19:53 EST 2020. Contains 331096 sequences. (Running on oeis4.)