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 A094252 #16 Feb 28 2018 21:38:33
%S A094252 1,2,3,5,7,11,15,3,7,13,25,3,19,6,35,19,2,19,21,59,62,54,10,62,18,12,
%T A094252 23,80,96,67,111,96,5,78,132,8,128,98,123,143,12,141,40,98,90,88,53,
%U A094252 93,97,187,186,47,2,117,241,34,27,51,266,108,259,115,278,30,281,227,244,141
%N A094252 a(n) = partition(n) mod prime(n).
%C A094252 Indices n such that a(n)=0 (i.e., prime(n) divides partition(n)) are listed in A245662. - _Max Alekseyev_, Jul 27 2014
%H A094252 Vincenzo Librandi, <a href="/A094252/b094252.txt">Table of n, a(n) for n = 1..1000</a>
%e A094252 a(10) = 13: partition(10) = 42, prime(10) = 29. 42 mod 29 = 13.
%t A094252 Table[ Mod[ PartitionsP[n], Prime[n]], {n, 70}] (* _Robert G. Wilson v_, Apr 28 2004 *)
%Y A094252 Cf. A000041, A093952, A245525.
%K A094252 nonn
%O A094252 1,2
%A A094252 _Gary W. Adamson_, Apr 25 2004
%E A094252 Edited by _Robert G. Wilson v_, Apr 28 2004