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!)
A089792 a(n) = n-(exponent of highest power of 3 dividing n!). 3
0, 1, 2, 2, 3, 4, 4, 5, 6, 5, 6, 7, 7, 8, 9, 9, 10, 11, 10, 11, 12, 12, 13, 14, 14, 15, 16, 14, 15, 16, 16, 17, 18, 18, 19, 20, 19, 20, 21, 21, 22, 23, 23, 24, 25, 24, 25, 26, 26, 27, 28, 28, 29, 30, 28, 29, 30, 30, 31, 32, 32, 33, 34, 33 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
The exponent of the highest power of 3 dividing binomial(n,k) is given by a(k)+a(n-k)-a(n).
LINKS
FORMULA
a(n) = a(n-1)+1-A007949(n).
a(n) = log(denominator(n!/3^n))/log(3); a(n) = log_3(A125824(n)). - Paul Barry, Apr 02 2007
a(n) = n - A054861(n).
MATHEMATICA
Table[n-IntegerExponent[n!, 3], {n, 0, 70}] (* Harvey P. Dale, Aug 09 2015 *)
PROG
(PARI) vector(70, n, n--; n-valuation(n!, 3)) \\ Michel Marcus, Aug 19 2015
CROSSREFS
Sequence in context: A168560 A333942 A065361 * A081608 A096532 A335380
KEYWORD
easy,nonn
AUTHOR
Paul Boddington, Jan 09 2004
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 April 25 09:38 EDT 2024. Contains 371967 sequences. (Running on oeis4.)