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 A115277 #9 Oct 25 2015 10:58:10
%S A115277 1,1,2,5,12,37,143,562,2320,10941,54865,283890,1604155,9558226,
%T A115277 58668223,384572975,2631778832,18576630237,137919691717,1060303298138,
%U A115277 8415786131309,69538205444478,591734670548037,5194542789203877,47127033586211659,438972204436025198
%N A115277 Number of partitions of {1,...,n} into blocks such that no even sized block is repeated.
%H A115277 Alois P. Heinz, <a href="/A115277/b115277.txt">Table of n, a(n) for n = 0..500</a>
%F A115277 E.g.f.: exp(sinh(x)) * Product {m >= 1} (1+x^(2*m)/(2*m)!).
%p A115277 with(combinat):
%p A115277 b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0, add(
%p A115277 multinomial(n, n-i*j, i$j)/j!*b(n-i*j, i-1), j=0..min(
%p A115277 `if`(irem(i, 2)=0, 1, n), n/i))))
%p A115277 end:
%p A115277 a:= n-> b(n$2):
%p A115277 seq(a(n), n=0..30); # _Alois P. Heinz_, Mar 08 2015
%t A115277 multinomial[n_, k_List] := n!/Times @@ (k!); b[n_, i_] := b[n, i] = If[n == 0, 1, If[i<1, 0, Sum[multinomial[n, Join[{n-i*j}, Array[i&, j]]]/j! * b[n-i*j, i-1], {j, 0, Min[If[Mod[i, 2]==0, 1, n], n/i]}]]]; a[n_] := b[n, n]; Table[a[n], {n, 0, 30}] (* _Jean-François Alcover_, Oct 25 2015, after _Alois P. Heinz_ *)
%Y A115277 Cf. A001935, A115275, A115276, A115278.
%K A115277 nonn
%O A115277 0,3
%A A115277 _Christian G. Bower_, Jan 18 2006