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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A047224 Smallest k>n where n is a square modulo k. 1
 1, 2, 7, 6, 5, 10, 10, 9, 14, 10, 13, 14, 13, 17, 22, 17, 17, 19, 21, 25, 22, 25, 26, 26, 25, 26, 34, 33, 29, 35, 34, 33, 34, 34, 37, 38, 37, 41, 43, 41, 41, 43, 47, 49, 49, 55, 49, 53, 52, 50, 62, 58, 53, 58, 57, 57, 61, 58, 61, 62, 61, 65, 67, 74, 65, 67, 75, 73, 76, 73, 73 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS T. D. Noe, Table of n, a(n) for n = 0..1000 CROSSREFS Sequence in context: A011263 A074067 A110988 * A127817 A199173 A047232 Adjacent sequences: A047221 A047222 A047223 * A047225 A047226 A047227 KEYWORD easy,nonn AUTHOR Henry Bottomley, 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 6 16:00 EST 2022. Contains 358644 sequences. (Running on oeis4.)