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 A115275 #13 Aug 22 2025 19:08:13
%S A115275 1,1,2,5,14,51,187,820,3670,18191,97917,554500,3334465,20871592,
%T A115275 138440031,972083845,6985171390,52194795327,412903730293,
%U A115275 3313067916192,28017395030419,241504438776956,2189375704925081,19771679215526507,187677937412341677
%N A115275 Number of partitions of {1,...,n} into blocks such that no block size is repeated more than 3 times.
%H A115275 Alois P. Heinz, <a href="/A115275/b115275.txt">Table of n, a(n) for n = 0..626</a>
%F A115275 E.g.f.: Product {m >= 1} (1+x^m/m!+(x^m/m!)^2+(x^m/m!)^3). [this e.g.f. is incorrect. - _Vaclav Kotesovec_, Oct 29 2015]
%p A115275 with(combinat):
%p A115275 b:= proc(n, i) option remember; `if`(n=0, 1,
%p A115275 `if`(i<1, 0, add(multinomial(n, n-i*j, i$j)/j!*
%p A115275 b(n-i*j, i-1), j=0..min(3, n/i))))
%p A115275 end:
%p A115275 a:= n-> b(n$2):
%p A115275 seq(a(n), n=0..25); # _Alois P. Heinz_, Sep 17 2015
%t A115275 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[3, n/i]}]]]; a[n_] := b[n, n]; Table[a[n], {n, 0, 25}] (* _Jean-François Alcover_, Oct 29 2015, after _Alois P. Heinz_ *)
%Y A115275 Cf. A000110, A001935, A007837, A115276, A115277.
%K A115275 nonn
%O A115275 0,3
%A A115275 _Christian G. Bower_, Jan 18 2006