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 A093952 #12 Feb 11 2014 07:00:05
%S A093952 0,0,0,1,2,5,1,6,3,2,1,5,10,9,11,7,8,7,15,7,15,12,13,15,8,18,13,22,12,
%T A093952 24,22,29,12,2,8,13,29,23,24,18,16,2,8,23,34,34,16,9,16,26,39,9,6,1,1,
%U A093952 31,36,22,38,47,20,16,51,62,28,56,24,59,17,38,58,55,34,4,39,67,23,44,29
%N A093952 Partition number A000041(n) mod n.
%H A093952 T. D. Noe, <a href="/A093952/b093952.txt">Table of n, a(n) for n=1..5000</a>
%e A093952 a(9) = 3 since the partition number for 9 = 30 and 30 mod 9 = 3.
%t A093952 Table[ Mod[ PartitionsP@ n, n], {n, 80}] (* _Robert G. Wilson v_, Mar 25 2011 *)
%Y A093952 Cf. A000041.
%K A093952 nonn,easy
%O A093952 1,5
%A A093952 _Gary W. Adamson_, Apr 18 2004
%E A093952 More terms from Pab Ter (pabrlos(AT)yahoo.com), May 24 2004