This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A230404 a(n) = the largest k such that (k+1)! divides 2n; the number of trailing zeros in the factorial base representation of even numbers. 3
 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 4, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 3, 1, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Antti Karttunen, Table of n, a(n) for n = 1..10080 FORMULA a(n) = A230403(2n) = A055881(2n)-1. PROG (Scheme) (define (A230404 n) (A230403 (* 2 n))) CROSSREFS Used to compute A230405 and A219650. See A007623 for factorial base representation. Analogous sequence for binary system: A001511. Sequence in context: A161072 A161111 A161046 * A082647 A214018 A304869 Adjacent sequences:  A230401 A230402 A230403 * A230405 A230406 A230407 KEYWORD nonn,easy AUTHOR Antti Karttunen, Oct 31 2013 STATUS approved

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

Last modified November 13 02:28 EST 2018. Contains 317120 sequences. (Running on oeis4.)