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.

A096197 a(n) = (1+prime(n)) mod n.

This page as a plain text file.
%I A096197 #12 Sep 08 2022 08:45:14
%S A096197 0,0,0,0,2,2,4,4,6,0,10,2,3,2,3,6,9,8,11,12,11,14,15,18,23,24,23,24,
%T A096197 23,24,4,4,6,4,10,8,10,12,12,14,16,14,20,18,18,16,24,32,32,30,30,32,
%U A096197 30,36,38,40,42,40,42,42,40,46,56,56,54,54,64,66,3,0,70,0,3,4,5,4,5,8,7,10,15
%N A096197 a(n) = (1+prime(n)) mod n.
%C A096197 Graph is similar to that of A004648.
%H A096197 Vincenzo Librandi, <a href="/A096197/b096197.txt">Table of n, a(n) for n = 1..1000</a>
%t A096197 Table[Mod[Prime[n] + 1, n], {n, 100}] (* _Vincenzo Librandi_, Sep 11 2014 *)
%o A096197 (Magma) [(NthPrime(n)+1) mod(n): n in [1..90]]; // _Vincenzo Librandi_, Sep 11 2014
%o A096197 (PARI) lista(nn) = {forprime(p=2, n, print1((p+1) % primepi(p), ", "););} \\ _Michel Marcus_, Sep 11 2014
%Y A096197 Cf. A082495, A006521, A087611, A004648.
%K A096197 nonn,easy
%O A096197 1,5
%A A096197 _Labos Elemer_, Jul 26 2004