|
Search: id:A062843
|
|
|
| A062843 |
|
Maximum number of ones in the representation of n in any base. |
|
+0
1
|
|
| 1, 1, 2, 2, 2, 2, 3, 2, 2, 2, 3, 2, 3, 3, 4, 2, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 2, 2, 3, 2, 3, 3, 4, 4, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 2, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
EXAMPLE
|
a[11]=3 since 11 in base 3 is 1011, containing 3 ones
|
|
MAPLE
|
seq(max(numboccur(convert(i, base, 2), 1), numboccur(convert(i, base, 3), 1), numboccur(convert(i, base, 4), 2), numboccur(convert(i, base, 5), 1), numboccur(convert(i, base, 6), 1), numboccur(convert(i, base, 7), 1), numboccur(convert(i, base, 8), 1), numboccur(convert(i, base, 9), 1), numboccur(convert(i, base, 10), 1), numboccur(convert(i, base, 11), 1), numboccur(convert(i, base, 12), 1), numboccur(convert(i, base, 13), 1), numboccur(convert(i, base, 14), 1), numboccur(convert(i, base, 15), 1), numboccur(convert(i, base, 16), 1), numboccur(convert(i, base, 17), 1)), i=1..200);
|
|
CROSSREFS
|
Sequence in context: A083399 A105561 A087133 this_sequence A136164 A033947 A069719
Adjacent sequences: A062840 A062841 A062842 this_sequence A062844 A062845 A062846
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Erich Friedman (efriedma(AT)stetson.edu), Jul 21 2001
|
|
EXTENSIONS
|
Maple code and more terms from Barbara Haas Margolius (b.margolius(AT)csuohio.edu) Oct 10, 2001
|
|
|
Search completed in 0.002 seconds
|
