This site is supported by donations to The OEIS Foundation.
User talk:Jens Kruse Andersen
From OeisWiki
New question:
Do you know of any general formula that can be used to find numbers that -k is never a square mod?? The sequence starts:
- k=1: All primes 1 less than a multiple of 4 (as well as composite number 4)
- k=2: All primes 1 or 3 less than a multiple of 8
- k=3: All primes 1 less than a multiple of 6
- k=4: All primes 1 less than a multiple of 4
- k=5: All primes 1, 3, 7, or 9 less than a multiple of 20.
- k=6: Do you know??
J. Lowell 14:25, 9 August 2014 (UTC)