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 A036886 #10 Mar 30 2012 17:26:42 %S A036886 1,3,6,13,27,61,132,285,590,1190,2325,4441,8288,15197,27394,48679, %T A036886 85332,147790,253016,428602,718696,1193779,1964996,3206966,5191350, %U A036886 8339001,13296592,21053380,33112242,51746168,80372146,124104612,190557592 %N A036886 Number of partitions of 5n such that cn(0,5) = cn(1,5) = cn(4,5) < cn(2,5) = cn(3,5). %C A036886 Alternatively, number of partitions of 5n such that cn(0,5) = cn(2,5) = cn(3,5) < cn(1,5) = cn(4,5). %C A036886 For a given partition, cn(i,n) means the number of its parts equal to i modulo n. %H A036886 <a href="/wiki/Partitions_of_5n">Index and properties of sequences related to partitions of 5n</a> %F A036886 a(n) = A036884(n) - A046776(n) %F A036886 a(n) = A036885(n) - A036894(n) %F A036886 a(n) = A036883(n) - A036893(n) %K A036886 nonn %O A036886 1,2 %A A036886 _Olivier Gérard_ %E A036886 Terms a(10) onward from _Max Alekseyev_, Dec 10 2011