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 A278196 #13 Nov 23 2016 10:59:08 %S A278196 2436,5604,451276,715220,831820,1300156,7089500,12132164,15796476, %T A278196 26543660,190569292,483502844,761002156,851376628,1327710076, %U A278196 2841940500,3519222692,9035836076,54770336324,1280011042268,1820701100652,3972999029388,6085253859260 %N A278196 Partition numbers (A000041) of the form 2^2 * k for odd k. %C A278196 Also partition numbers having twice as many even divisors as odd divisors. %C A278196 A subsequence of A225324. %H A278196 Colin Barker, <a href="/A278196/b278196.txt">Table of n, a(n) for n = 1..1000</a> %t A278196 Select[PartitionsP@ Range@ 210, Count[#, k_ /; EvenQ@ k] == 2 Count[#, k_ /; OddQ@ k] &@ Divisors@ # &] (* _Michael De Vlieger_, Nov 15 2016 *) %o A278196 (PARI) maxk=300; L=List(); for(k=1, maxk, p=numbpart(k); if(p%2^2==0 & p\2^2%2==1, listput(L, p))); Vec(L) %Y A278196 Cf. A275029, A278197, A278198, A278199, A278200, A278201. %K A278196 nonn %O A278196 1,1 %A A278196 _Colin Barker_, Nov 15 2016