cp's OEIS Frontend

A005575 a(n) = A259095(2n,n).

%I A005575 M1390 #33 Jul 28 2016 05:23:10
%S A005575 0,0,1,2,5,11,20,37,63,110,174,283,435,671,1001,1492,2160,3127,4442,
%T A005575 6269,8739,12109,16597,22618,30576,41077,54834,72788,96056,126131,
%U A005575 164829,214327,277534,357810,459507,587779,749220,951473,1204501,1519691,1911618,2397247,2997985,3738482,4649981,5768457,7138640,8812704,10854735,13339286
%N A005575 a(n) = A259095(2n,n).
%C A005575 Computed by _R. K. Guy_ in 1988.
%D A005575 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A005575 Alois P. Heinz, <a href="/A005575/b005575.txt">Table of n, a(n) for n = 1..900</a>
%H A005575 F. C. Auluck, <a href="http://dx.doi.org/10.1017/S0305004100027134">On some new types of partitions associated with generalized Ferrers graphs</a>, Proc. Cambridge Philos. Soc. 47, (1951), 679-686.
%H A005575 R. K. Guy, <a href="/A259095/a259095.pdf">Letter to N. J. A. Sloane, Apr 08 1988</a> (annotated scanned copy, included with permission)
%H A005575 E. M. Wright, <a href="http://qjmath.oxfordjournals.org/content/23/2/153.extract">Stacks, III</a>, Quart. J. Math. Oxford, 23 (1972), 153-158.
%p A005575 b:= proc(n, i, d) option remember; `if`(i*(i+1)/2<n, 0,
%p A005575      `if`(n=0, 1, b(n, i-1, d+1)+`if`(i>n, 0, d*b(n-i, i-1, 1))))
%p A005575     end:
%p A005575 a:= n-> b(n, n-1, 1):
%p A005575 seq(a(n), n=1..50);  # _Alois P. Heinz_, Jul 08 2016
%t A005575 b[n_, i_, d_] := b[n, i, d] = If[i*(i+1)/2 < n, 0, If[n == 0, 1, b[n, i-1, d+1] + If[i > n, 0, d*b[n-i, i-1, 1]]]];
%t A005575 a[n_] := b[n, n-1, 1];
%t A005575 Table[a[n], {n, 1, 50}] (* _Jean-François Alcover_, Jul 28 2016, after _Alois P. Heinz_ *)
%Y A005575 Cf. A259095, A005576, A005577.
%K A005575 nonn,nice
%O A005575 1,4
%A A005575 _N. J. A. Sloane_, _R. K. Guy_
%E A005575 Edited by _N. J. A. Sloane_, Jun 20 2015
%E A005575 Terms a(25) and beyond from _Joerg Arndt_, Apr 09 2016