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 A278199 #11 Nov 28 2016 08:11:43 %S A278199 4087968,625846753120,576672674947168,1896564103591584, %T A278199 21424521360255636320,61382395164161775318496, %U A278199 25744258930034131533263392,54951205445179608281719072,1317709210896221493178043552,172557592110602218633091543840,6647848746214407376439536432805536 %N A278199 Partition numbers (A000041) of the form 2^5 * k for odd k. %C A278199 Also partition numbers having five times as many even divisors as odd divisors. %H A278199 Colin Barker, <a href="/A278199/b278199.txt">Table of n, a(n) for n = 1..300</a> %t A278199 Select[PartitionsP@ Range@ 1200, Count[#, k_ /; EvenQ@ k] == 5 Count[#, k_ /; OddQ@ k] &@ Divisors@ # &] (* _Michael De Vlieger_, Nov 15 2016 *) %o A278199 (PARI) maxk=1400; L=List(); for(k=1, maxk, p=numbpart(k); if(p%2^5==0 & p\2^5%2==1, listput(L, p))); Vec(L) %Y A278199 Cf. A275029, A278196, A278197, A278198, A278200, A278201. %K A278199 nonn %O A278199 1,1 %A A278199 _Colin Barker_, Nov 15 2016