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 A036892 #10 Mar 30 2012 17:26:42 %S A036892 0,1,3,7,14,30,62,133,275,562,1109,2145,4035,7457,13509,24115,42405, %T A036892 73667,126420,214681,360778,600625,990756,1620449,2628504,4230770, %U A036892 6758916,10721739,16892541,26443435,41137558,63618639,97825383,149605621,227593695 %N A036892 Number of partitions of 5n such that cn(1,5) = cn(4,5) < cn(0,5) = cn(2,5) = cn(3,5). %C A036892 Alternatively, number of partitions of 5n such that cn(2,5) = cn(3,5) < cn(0,5) = cn(1,5) = cn(4,5). %C A036892 For a given partition, cn(i,n) means the number of its parts equal to i modulo n. %H A036892 <a href="/wiki/Partitions_of_5n">Index and properties of sequences related to partitions of 5n</a> %F A036892 a(n) = A036891(n) - A036895(n) %F A036892 a(n) = A036890(n) - A036894(n) %F A036892 a(n) = A036889(n) - A046776(n) %K A036892 nonn %O A036892 1,3 %A A036892 _Olivier Gérard_ %E A036892 Terms a(10) onward from _Max Alekseyev_, Dec 11 2011