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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A324469 Exponent of highest power of 3 that divides multinomial(4*n;n,n,n,n). 1
 0, 1, 2, 1, 2, 4, 2, 5, 6, 1, 2, 3, 2, 3, 6, 4, 6, 7, 2, 3, 4, 5, 6, 8, 6, 8, 9, 1, 2, 3, 2, 3, 5, 3, 6, 7, 2, 3, 4, 3, 4, 8, 6, 8, 9, 4, 5, 6, 6, 7, 9, 7, 9, 10, 2, 3, 4, 3, 4, 6, 4, 9, 10, 5, 6, 7, 6, 7, 10, 8, 10, 11, 6, 7, 8, 8, 9, 11, 9, 11, 12, 1, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Amiram Eldar, Table of n, a(n) for n = 0..10000 FORMULA a(n) = 2*A000989(n) + A000989(2*n). - Charlie Neder, Mar 09 2019 From Amiram Eldar, Feb 21 2021: (Start) a(n) = A007949(A008977(n)). a(n) = 2*A053735(n) - A053735(4*n)/2. (End) MAPLE [seq(padic[ordp](combinat[multinomial](4*n, n\$4), 3), n=0..128)]; MATHEMATICA s[n_] := Plus @@ IntegerDigits[n, 3]; a[n_] := 2*s[n] - s[4*n]/2; Array[a, 100, 0] (* Amiram Eldar, Feb 21 2021 *) CROSSREFS Analogs for binomial and trinomials: A000989, A053735. See also A324467. Cf. A007949 (3-adic valuation of n), A008977. Sequence in context: A263050 A060547 A079878 * A329688 A217920 A137406 Adjacent sequences: A324466 A324467 A324468 * A324470 A324471 A324472 KEYWORD nonn AUTHOR N. J. A. Sloane, Mar 03 2019 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.

Last modified December 5 03:48 EST 2023. Contains 367567 sequences. (Running on oeis4.)