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 A278197 #11 Nov 23 2016 10:59:14 %S A278197 56,792,8118264,92669720,150198136,1188908248,1844349560,3163127352, %T A278197 4351078600,5371315400,7346629512,11097645016,16670689208,18440293320, %U A278197 684957390936,6622987708040,51820051838712,77195892663512,133978259344888,197726516681672 %N A278197 Partition numbers (A000041) of the form 2^3 * k for odd k. %C A278197 Also partition numbers having three times as many even divisors as odd divisors. %H A278197 Colin Barker, <a href="/A278197/b278197.txt">Table of n, a(n) for n = 1..1000</a> %t A278197 Select[PartitionsP@ Range@ 250, Count[#, k_ /; EvenQ@ k] == 3 Count[#, k_ /; OddQ@ k] &@ Divisors@ # &] (* _Michael De Vlieger_, Nov 15 2016 *) %o A278197 (PARI) maxk=300; L=List(); for(k=1, maxk, p=numbpart(k); if(p%2^3==0 & p\2^3%2==1, listput(L, p))); Vec(L) %Y A278197 Cf. A275029, A278196, A278198, A278199, A278200, A278201. %K A278197 nonn %O A278197 1,1 %A A278197 _Colin Barker_, Nov 15 2016