The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A129532 3n(n-1)4^(n-2). 4
0, 0, 6, 72, 576, 3840, 23040, 129024, 688128, 3538944, 17694720, 86507520, 415236096, 1962934272, 9160359936, 42278584320, 193273528320, 876173328384, 3942779977728, 17626545782784, 78340203479040, 346346162749440 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Number of inversions in all 4-ary words of length n on {0,1,2,3}. Example: a(2)=6 because each of the words 10,20,30,21,31,32 has one inversion and the words 00,01,02,03,11,12,13,22,23,33 have no inversions. a(n)=Sum(k*A129531(n,k),k>=0). a(n)=6*A038845(n-2).
LINKS
FORMULA
G.f.=6x^2/(1-4x)^3.
MAPLE
seq(3*n*(n-1)*4^(n-2), n=0..25);
MATHEMATICA
Table[3n(n-1)4^(n-2), {n, 0, 30}] (* or *) LinearRecurrence[{12, -48, 64}, {0, 0, 6}, 30] (* Harvey P. Dale, May 25 2018 *)
CROSSREFS
Sequence in context: A177468 A052791 A334327 * A151719 A118313 A283095
KEYWORD
nonn
AUTHOR
Emeric Deutsch, Apr 22 2007
STATUS
approved

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 June 15 03:12 EDT 2024. Contains 373402 sequences. (Running on oeis4.)