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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A212698 Main transitions in systems of n particles with spin 3/2. 11

%I #55 Feb 28 2024 02:10:37

%S 3,24,144,768,3840,18432,86016,393216,1769472,7864320,34603008,

%T 150994944,654311424,2818572288,12079595520,51539607552,219043332096,

%U 927712935936,3917010173952,16492674416640,69269232549888,290271069732864,1213860837064704,5066549580791808

%N Main transitions in systems of n particles with spin 3/2.

%C Please refer to the general explanation in A212697. This particular sequence is obtained for base b=4, corresponding to spin S = (b-1)/2 = 3/2.

%C Let P(A) be the power set of an n-element set A and let B be the Cartesian product of P(A) with itself. Then a(n) = the sum of the size of the union of x and y for every (x,y) in B. [See Relation (28): U(n) in document of Ross La Haye in reference.] - _Bernard Schott_, Jan 04 2013

%C A002697 is the analogous sequence if "union" is replaced by "intersection" and A002699 is the analogous sequence if "union" is replaced by "symmetric difference". Here, X union Y and Y union X are considered as two distinct Cartesian products, if we want to consider that X Union Y = Y Union X are the same Cartesian product, see A133224. - _Bernard Schott_ Jan 11 2013

%H Stanislav Sykora, <a href="/A212698/b212698.txt">Table of n, a(n) for n = 1..100</a>

%H Ross La Haye, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL12/LaHaye/lahaye5.html">Binary Relations on the Power Set of an n-Element Set</a>, Journal of Integer Sequences, Vol. 12 (2009), Article 09.2.6.

%H Stanislav Sýkora, <a href="http://www.ebyte.it/stan/blog12to14.html#14Dec31">Magnetic Resonance on OEIS</a>, Stan's NMR Blog (Dec 31, 2014), Retrieved Nov 12, 2019.

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (8, -16).

%F a(n) = n*(b-1)*b^(n-1). For this sequence, set b=4.

%F a(n) = 3*n*4^(n-1).

%F a(n) = 3 * A002697(n).

%F a(n) = Sum_{i>=0} binomial(n,i)*i*3^i. - _Geoffrey Critzer_, Aug 08 2013

%F E.g.f.: 3*x*exp(4*x). - _Geoffrey Critzer_, Aug 08 2013

%F G.f.: 3*x / (4*x-1)^2. - _Colin Barker_, Nov 03 2014

%t Table[Sum[Binomial[n,i] i 3^i,{i,0,n}],{n,1,21}] (* _Geoffrey Critzer_, Aug 08 2013 *)

%o (PARI) mtrans(n, b) = n*(b-1)*b^(n-1);

%o for (n=1, 100, write("b212698.txt", n, " ", mtrans(n, 4)))

%o (Magma) [3*n*4^(n-1): n in [1..30]]; // _Vincenzo Librandi_, Nov 29 2015

%Y Cf. A001787, A212697, A212699, A212700, A212701, A212702, A212703, A212704 (for b = 2, 3, 5, 6, 7, 8, 9, 10).

%Y Cf. A002697, A002699, A133224.

%K nonn,easy

%O 1,1

%A _Stanislav Sykora_, May 25 2012

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 April 19 04:35 EDT 2024. Contains 371782 sequences. (Running on oeis4.)