The OEIS is supported by the many generous donors to the OEIS Foundation.



Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A120672 a(n) = 2 * A285917(n) for n >=2, a(0) = a(1) = 0. 1
0, 0, 2, 12, 22, 60, 104, 252, 438, 1020, 1792, 4092, 7264, 16380, 29332, 65532, 118198, 262140, 475664, 1048572, 1912392, 4194300, 7683172, 16777212, 30850272, 67108860, 123817124, 268435452, 496754308, 1073741820, 1992366124, 4294967292, 7988854198 (list; graph; refs; listen; history; text; internal format)



Previous name was: Consider a set A containing at least n-1 elements of sort "a" and a set B containing at least n-1 elements of sort "b". From set A we take i elements, from set B we take (n-i) elements such that i + (n-i) = n. Then we distribute these n elements in two urns L (left) and R (right). The order of selection among the two sorts counts. Equivalently we can say: Then we form two sequences L and R from these n elements. The position of the sort of the elements within the sequences counts. Furthermore, the occupations of the urns are permuted. In other words, the order of the sequences L and R is swapped from L|R to R|L.

A028399(n) = 2*2^n - 4 with n=1,2,3,... is an upper limit for a(n) because Sum_{i=1..n-1} 2*n!/(i!*(n-i)!) = 2*2^n - 4. a(n) follows from all distinct ordered 2-tuples of positive integers whose elements sum to n. See the first Maple program below.


Table of n, a(n) for n=0..32.


For the number a(n) of such [L|R] configurations we have a(n) = n!*Sum_{i=1..n-1} delta2(i,n-i)/(i!*(n-i)!) where delta2(n,n-i) = 2 if i <> (n-i) and 1 if i = (n-i).

a(n) = A028399(n) - A126869(n), n > 0. - R. J. Mathar, Aug 07 2008


For n=3 we have a(n=3)=12 configurations [L|R] and [R|L]: [aaa|b], [b|aaa], [baa|a], [a|baa], [aba|a], [a|aba], [aab|a], [a|aab] and [bbb|a], [a|bbb], [abb|b], [b|abb], [bab|b], [b|bab], [bba|b], [b|bba].


A120672 := proc(n::integer) local i, k, cmpstnlst, cmpstn, NumberOfParts, liste, NumberOfDifferentParts, Result; k:=2; Result := 0; cmpstnlst := composition(n, k); NumberOfParts := 0; NumberOfDifferentParts := 0; for i from 1 to nops(cmpstnlst) do cmpstn := cmpstnlst[i]; NumberOfParts := nops(cmpstn); if NumberOfParts > 0 then liste := convert(cmpstn, multiset); else liste := NULL; fi; if liste <> NULL then NumberOfDifferentParts := nops(liste); else NumberOfDifferentParts := 0; fi; Result := Result + n!/mul(op(j, cmpstn)!, j=1..NumberOfParts)*(NumberOfParts!/ mul(op(2, op(j, liste))!, j=1..NumberOfDifferentParts)); od; print(Result); end proc;

A120672 := proc(n) local i, Term, Result; Result:=0; for i from 1 to n-1 do Term:=n!/(i!*(n-i)!); if i <> n-i then Term:=2*Term; fi; Result:=Result+Term; end do; print(Result); end proc;


Cf. A028399, A126869.

Sequence in context: A017293 A244188 A189330 * A190642 A108960 A111095

Adjacent sequences: A120669 A120670 A120671 * A120673 A120674 A120675




Thomas Wieder, Jun 24 2006


Simpler name referring to A285917 from Joerg Arndt, Jun 25 2019



Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 9 04:13 EST 2022. Contains 358698 sequences. (Running on oeis4.)