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.

A179396 a(n) = prime(n)^2 modulo prime(n+4).

This page as a plain text file.
%I A179396 #12 Sep 14 2017 20:29:37
%S A179396 4,9,8,11,6,24,10,28,37,24,21,44,29,19,65,40,50,8,7,57,91,80,91,3,35,
%T A179396 31,68,52,99,120,37,98,86,87,157,138,126,143,3,14,127,125,189,8,219,
%U A179396 213,18,17,196,233,62,50,246,129,123,43,196,191,286,278,274,259,245,2,115,326,131,125,33,203,297,193,95,179
%N A179396 a(n) = prime(n)^2 modulo prime(n+4).
%F A179396 a(n) = A001248(n) mod A000040(n+4).
%e A179396 a(1)=2^2 mod(11)=4 mod(11)=4.
%e A179396 a(2)=3^2 mod(13)=9 mod(13)=9.
%e A179396 a(3)=5^2 mod(17)=25 mod(17)=8.
%e A179396 a(4)=7^2 mod(19)=49 mod(19)=11.
%o A179396 (PARI) a(n) = prime(n)^2 % prime(n+4) \\ _Michel Marcus_, Aug 06 2013
%Y A179396 Cf. A167770.
%K A179396 nonn,easy
%O A179396 1,1
%A A179396 _Umut Uludag_, Jan 07 2011