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.
%I A283225 #22 Feb 12 2021 01:34:39 %S A283225 2,3,5,7,11,13,17,19,23,29,31,43,47,53,59,61,73,79,83,89,109,113,137, %T A283225 139,199,211,241,283,293,313,317,523,1321,1327 %N A283225 Primes prime(k) such that prime(k)^2 mod prime(k+2) is different from prime(k+2)^2 mod prime(k). %C A283225 I conjecture that there are no other terms in this sequence. %C A283225 A124129 is constructed in a similar way: by comparing the values of prime(k)^2 mod prime(k+1) and prime(k+1)^2 mod prime(k). %C A283225 If it exists, then a(35) > 10^12. - _Lucas A. Brown_, Feb 11 2021 %e A283225 a(10) = prime(10) = 29 is in the sequence because the remainder of the division of 29^2 = 841 by prime(12) = 37 is 27, which is different from the remainder of the division of 37^2 = 1369 by prime(10) = 29, which is 6. %t A283225 Select[Prime[Range[250]],PowerMod[#,2,NextPrime[#,2]] != PowerMod[ NextPrime[ #,2],2,#]&] (* _Harvey P. Dale_, Nov 17 2020 *) %Y A283225 Cf. A124129. %K A283225 more,nonn %O A283225 1,1 %A A283225 _Arnaud Vernier_, Mar 03 2017