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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A064464 Binary order (cf. A029837) of the number of parts if 3^n is partitioned into parts of size 2^n as far as possible and into parts of size 1^n (cf. A060692). 1
 1, 2, 3, 3, 5, 6, 5, 8, 9, 10, 11, 12, 13, 14, 15, 16, 16, 18, 19, 19, 21, 22, 23, 21, 23, 26, 25, 28, 25, 26, 31, 32, 33, 34, 35, 35, 37, 38, 39, 39, 40, 42, 43, 44, 44, 46, 47, 47, 47, 48, 50, 51, 51, 54, 54, 56, 56, 58, 59, 60, 60, 59, 63, 63, 63, 66, 65, 67, 69, 69, 70, 69 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS These binary orders are nearly equal to n. For several values of n, a(n) = n holds, e.g., for n = 1, 2, 3, 5, 6, 8, 9, 10, 11,12. LINKS FORMULA a(n) = A029837(A060692(n)) = ceiling(log_2(A060692(n))). EXAMPLE For n=12, 3^12 = 531441 = 129*2^12 + 3057*1^12; the binary order of 129 + 3057 = 3186 is ceiling(log_2(3186)) = 12, the exponent. PROG (PARI) {for(n=1, 72, d=divrem(3^n, 2^n); print1(ceil(log(d[1]+d[2])/log(2)), ", "))} CROSSREFS Cf. A029837, A060692, A064630. Sequence in context: A023156 A051599 A207292 * A094585 A183322 A295918 Adjacent sequences:  A064461 A064462 A064463 * A064465 A064466 A064467 KEYWORD nonn AUTHOR Labos Elemer, Oct 03 2001; revised Mar 10 2002 EXTENSIONS Edited by Klaus Brockhaus, May 24 2003 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 August 13 14:01 EDT 2022. Contains 356091 sequences. (Running on oeis4.)