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 A036887 #10 Mar 30 2012 17:26:42 %S A036887 1,2,4,10,25,62,145,323,689,1417,2831,5517,10532,19734,36377,66042, %T A036887 118240,208929,364689,629238,1073964,1814246,3035236,5031509,8268583, %U A036887 13476606,21793642,34981783,55753411,88258773,138813831,216978085,337147547 %N A036887 Number of partitions of 5n such that cn(1,5) = cn(4,5) <= cn(2,5) = cn(3,5) < cn(0,5). %C A036887 Alternatively, number of partitions of 5n such that cn(2,5) = cn(3,5) <= cn(1,5) = cn(4,5) < cn(0,5). %C A036887 For a given partition, cn(i,n) means the number of its parts equal to i modulo n. %H A036887 <a href="/wiki/Partitions_of_5n">Index and properties of sequences related to partitions of 5n</a> %F A036887 a(n) = A036882(n) - A036889(n) %F A036887 a(n) = A202086(n) + A036895(n) %K A036887 nonn %O A036887 1,2 %A A036887 _Olivier Gérard_ %E A036887 Terms a(10) onward from _Max Alekseyev_, Dec 10 2011