|
%I #19 May 05 2023 10:06:18
%S 1,2,4,7,11,15,20,25,30,36,42,48,54,60,66,73,80,87,94,101,108,115,122,
%T 129,136,143,150,158,166,174,182,190,198,206,214,222,230,238,246,254,
%U 262,270,278,286,294,302,310,318,326,334,342,350,359,368,377,386,395
%N The number of pairs of braces to note the properly nested set with n elements.
%H Alois P. Heinz, <a href="/A198759/b198759.txt">Table of n, a(n) for n = 0..20000</a>
%H F. T. Adams-Watters, <a href="http://list.seqfan.eu/oldermail/seqfan/2011-October/015746.html">Re: Set of sets using minimal number of braces</a>, SeqFan Oct 29 2011
%H J. Zucker, <a href="http://list.seqfan.eu/oldermail/seqfan/2011-October/015683.html">Set of sets using minimal number of braces</a>, SeqFan Oct 25 2011
%p # implementing the Adams-Watters partial sum formula up to nmax elements
%p read("transforms") ;
%p nmax := 40 ;
%p a004111rep := [1,1] ;
%p n := 2 ;
%p while nops(a004111rep) < nmax do
%p a004111rep := [op(a004111rep),seq(n,i=1..A004111(n))] ;
%p n := n+1 ;
%p end do:
%p PSUM(a004111rep) ;
%Y Cf. A004111.
%K nonn
%O 0,2
%A _R. J. Mathar_, Oct 29 2011
|
