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.

A261468 a(n) = prime(n+2) mod prime(n).

This page as a plain text file.
%I A261468 #17 Sep 08 2022 08:46:13
%S A261468 1,1,1,6,6,6,6,10,8,8,10,6,6,10,12,8,8,10,6,8,10,10,14,12,6,6,6,6,18,
%T A261468 18,10,8,12,12,8,12,10,10,12,8,12,12,6,6,14,24,16,6,6,10,8,12,16,12,
%U A261468 12,8,8,10,6,12,24,18,6,6,18,20,16,12,6,10,14,14,12
%N A261468 a(n) = prime(n+2) mod prime(n).
%F A261468 a(n) = A031131(n) = A075527(n) for n>3. - _Alois P. Heinz_, Aug 20 2015
%e A261468 a(3) = 11 mod 5 = 1.
%t A261468 a[n_]:=PowerMod[Prime[n + 2], 1, Prime[n]]; Table[a[n], {n, 80}] (* _Vincenzo Librandi_, Aug 20 2015 *)
%t A261468 Mod[#[[3]],#[[1]]]&/@Partition[Prime[Range[80]],3,1] (* _Harvey P. Dale_, Mar 14 2020 *)
%o A261468 (PARI) first(m)=vector(m,i,prime(i+2)% prime(i)); \\ _Anders Hellström_, Aug 20 2015
%o A261468 (Magma) [NthPrime(n+2) mod NthPrime(n): n in [1..80]]; // _Vincenzo Librandi_, Aug 20 2015
%Y A261468 Cf. A031131.
%K A261468 nonn,easy
%O A261468 1,4
%A A261468 _Altug Alkan_, Aug 20 2015