cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A332777 a(n) = k^2 mod p where p is the n-th prime and of the form 6k-1 or 6k+1.

This page as a plain text file.
%I A332777 #34 Jul 10 2020 18:00:35
%S A332777 1,1,4,4,9,9,16,25,25,36,8,6,17,28,41,39,54,2,71,11,30,47,62,87,83,3,
%T A332777 106,22,60,91,118,112,29,21,48,77,116,149,5,176,69,59,104,94,170,31,
%U A332777 82,70,123,166,154,7,50,95,142,128,177,242,228,57,145,216,200,273
%N A332777 a(n) = k^2 mod p where p is the n-th prime and of the form 6k-1 or 6k+1.
%C A332777 Offset is 3 because 5=prime(3) is the first prime of the given form. It is provable that if 6m-1 and 6m+1 are a pair of twin primes, then for all k, 0<k<m, and p being a prime of the form 6k-1 or 6k+1 then m^2 is not equivalent to k^2 mod p.
%o A332777 (PARI) a(n) = {my(p=prime(n), k); if (((p-1) % 6) == 0, k = (p-1)/6, k = (p+1)/6); k^2 % p;} \\ _Michel Marcus_, Jun 09 2020
%Y A332777 Cf. A002476, A007528, A024699.
%K A332777 nonn
%O A332777 3,3
%A A332777 _Keith Backman_, Jun 08 2020
%E A332777 More terms from _Michel Marcus_, Jun 09 2020