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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A034700 a(n) = smallest prime == 1 (mod 4) such that a(n) is a square mod a(i), all i<n. 1
5, 29, 109, 281, 349, 1601, 1889, 5581, 12421, 14389, 16829, 89501, 294761, 471781, 1134389, 2465081, 2708941, 4695809, 9594709, 33660421, 38692009, 75670769, 138202481, 150274469, 517777769 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

a(n) is also smallest prime == 1 (mod 4) such that a(i) is a square mod a(n), all i<n. Thus each a(i) is a square mod each a(j), i<>j.

CROSSREFS

Cf. A034698.

Sequence in context: A097345 A097344 A153076 * A057721 A085151 A119494

Adjacent sequences:  A034697 A034698 A034699 * A034701 A034702 A034703

KEYWORD

nonn,nice

AUTHOR

E. M. Rains (rains(AT)caltech.edu)

EXTENSIONS

More terms from David W. Wilson (davidwwilson(AT)comcast.net)

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 16 04:47 EST 2012. Contains 205860 sequences.