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 A036889 #10 Mar 30 2012 17:26:42 %S A036889 0,1,4,12,29,66,137,279,546,1057,2000,3746,6886,12508,22360,39477, %T A036889 68736,118309,201207,338672,564211,931342,1523628,2472228,3979651, %U A036889 6359094,10088975,15899507,24894711,38740189,59929503,92185390,141029958,214628608 %N A036889 Number of partitions of 5n such that cn(1,5) = cn(4,5) <= cn(0,5) = cn(2,5) = cn(3,5). %C A036889 Alternatively, number of partitions of 5n such that cn(2,5) = cn(3,5) <= cn(0,5) = cn(1,5) = cn(4,5). %C A036889 For a given partition, cn(i,n) means the number of its parts equal to i modulo n. %H A036889 <a href="/wiki/Partitions_of_5n">Index and properties of sequences related to partitions of 5n</a> %F A036889 a(n) = A036882(n) - A036887(n) %F A036889 a(n) = A036881(n) - A036885(n) %F A036889 a(n) = A046776(n) + A036892(n) %K A036889 nonn %O A036889 1,3 %A A036889 _Olivier Gérard_ %E A036889 Terms a(10) onward from _Max Alekseyev_, Dec 11 2011