login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A262931
Numbers k such that 6 is a square mod k.
2
1, 2, 3, 5, 6, 10, 15, 19, 23, 25, 29, 30, 38, 43, 46, 47, 50, 53, 57, 58, 67, 69, 71, 73, 75, 86, 87, 94, 95, 97, 101, 106, 114, 115, 125, 129, 134, 138, 139, 141, 142, 145, 146, 149, 150, 159, 163, 167, 173, 174, 190, 191, 193, 194, 197, 201, 202, 211, 213
OFFSET
1,2
LINKS
EXAMPLE
6^2 == 6 (mod 15), so 15 is a term.
MAPLE
with(numtheory):
a:= proc(n) option remember; local k;
for k from 1+`if`(n=1, 0, a(n-1))
while mroot(6, 2, k)=FAIL do od; k
end:
seq(a(n), n=1..80); # Alois P. Heinz, Feb 24 2017
MATHEMATICA
Join[{1}, Table[If[Reduce[x^2 == 6, Modulus->n] === False, Null, n], {n, 2, 300}]//Union] (* Vincenzo Librandi, Oct 05 2015 *)
PROG
(PARI) for(n=1, 300, if (issquare(Mod(6, n)), print1(n", "))); \\ Altug Alkan, Oct 04 2015
(Magma) [n: n in [1..300] | exists(t){x : x in ResidueClassRing(n) | x^2 eq 6}]; // Vincenzo Librandi, Oct 05 2015
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Erik Pelttari, Oct 04 2015
STATUS
approved