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 A115276 #8 Jan 20 2016 08:22:14
%S A115276 1,1,2,5,14,47,173,702,3124,14901,76405,417210,2411466,14731095,
%T A115276 94573911,636575050,4480990936,32887804361,251236573561,1993395483746,
%U A115276 16397468177406,139634290253907,1229013163330947,11166172488138322,104593176077399652
%N A115276 Number of partitions of {1,...,n} into block sizes not a multiple of 4.
%H A115276 Alois P. Heinz, <a href="/A115276/b115276.txt">Table of n, a(n) for n = 0..500</a>
%F A115276 E.g.f.: exp(sinh(x)+(cosh(x)-cos(x))/2).
%p A115276 a:= proc(n) option remember; `if`(n=0, 1, add(`if`(
%p A115276 irem(j, 4)=0, 0, binomial(n-1, j-1)*a(n-j)), j=1..n))
%p A115276 end:
%p A115276 seq(a(n), n=0..30); # _Alois P. Heinz_, Mar 17 2015
%t A115276 a[n_] := a[n] = If[n == 0, 1, Sum[If[Mod[j, 4] == 0, 0, Binomial[n - 1, j - 1]*a[n - j]], {j, 1, n}]]; Table[a[n], {n, 0, 30}] (* _Jean-François Alcover_, Jan 20 2016, after _Alois P. Heinz_ *)
%Y A115276 Cf. A001935, A003724, A115275, A115277.
%K A115276 nonn
%O A115276 0,3
%A A115276 _Christian G. Bower_, Jan 18 2006