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 A036891 #10 Mar 30 2012 17:26:42 %S A036891 0,1,4,11,26,59,129,279,588,1216,2451,4836,9326,17641,32746,59795, %T A036891 107507,190634,333661,577104,987043,1670725,2800269,4650351,7655282, %U A036891 12497879,20243241,32543510,51944000,82345113,129687646,202974550,315774972 %N A036891 Number of partitions of 5n such that cn(1,5) = cn(4,5) < cn(2,5) = cn(3,5) <= cn(0,5). %C A036891 Alternatively, number of partitions of 5n such that cn(2,5) = cn(3,5) < cn(1,5) = cn(4,5) <= cn(0,5). %C A036891 For a given partition, cn(i,n) means the number of its parts equal to i modulo n. %H A036891 <a href="/wiki/Partitions_of_5n">Index and properties of sequences related to partitions of 5n</a> %F A036891 a(n) = A036892(n) + A036895(n) %F A036891 a(n) = A036882(n) - A202085(n) %K A036891 nonn %O A036891 1,3 %A A036891 _Olivier Gérard_ %E A036891 Terms a(10) onward from _Max Alekseyev_, Dec 10 2011