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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053665 Smallest number m such that m = i^2 mod prime(i) for 1<=i<=n. 1
1, 1, 19, 79, 289, 18769, 198949, 6325069, 103321969, 1218786319, 98264184769, 3708353007109, 226330497051409, 2964582868796299, 120709434853826569, 21641851825451025919, 738603338323632009979 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

EXAMPLE

3rd tem is 19 because this is the smallest number such that n = 1^2 mod 2, n = 2^2 mod 3 and n = 3^2 mod 5.

CROSSREFS

Sequence in context: A201783 A139941 A127270 * A050522 A172973 A071633

Adjacent sequences:  A053662 A053663 A053664 * A053666 A053667 A053668

KEYWORD

easy,nonn

AUTHOR

Joe K. Crump (joecr(AT)carolina.rr.com), Feb 16 2000

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

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

Last modified February 15 05:45 EST 2012. Contains 205694 sequences.