cp's OEIS Frontend

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.

A202085 Number of partitions of 5n such that cn(1,5) = cn(4,5) = cn(2,5) = cn(3,5) <= cn(0,5).

This page as a plain text file.
%I A202085 #7 Mar 30 2012 17:27:07
%S A202085 1,2,4,11,28,69,153,323,647,1258,2380,4427,8092,14601,25991,45724,
%T A202085 79469,136604,232235,390806,651132,1074863,1758595,2853386,4592952,
%U A202085 7337821,11639376,18337780,28704122,44653849,69055688,106188925,162402533
%N A202085 Number of partitions of 5n such that cn(1,5) = cn(4,5) = cn(2,5) = cn(3,5) <= cn(0,5).
%C A202085 For a given partition, cn(i,n) means the number of its parts equal to i modulo n.
%H A202085 <a href="/wiki/Partitions_of_5n">Index and properties of sequences related to partitions of 5n</a>
%F A202085 a(n) = A046776(n) + A202086(n)
%F A202085 a(n) = A036882(n) - A036891(n)
%K A202085 nonn
%O A202085 1,2
%A A202085 _Max Alekseyev_, Dec 11 2011