The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A340500 a(n) = maximum among first n terms of A340488. 3
 0, 0, 1, 1, 1, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 9, 9, 9, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 13, 13, 13, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 COMMENTS The scatterplot evokes Cantor staircase function. - Rémy Sigrist, Jan 13 2021 LINKS Rémy Sigrist, Table of n, a(n) for n = 1..18218 Rémy Sigrist, PARI program for A340500 FORMULA Apparently, a(n) AND A340488(n) = A340488(n) (where AND denotes the bitwise AND operator). - Rémy Sigrist, Jan 13 2021 PROG (PARI) See Links section. CROSSREFS Cf. A340488. Sequence in context: A091195 A280617 A072375 * A131981 A257244 A130147 Adjacent sequences:  A340497 A340498 A340499 * A340501 A340502 A340503 KEYWORD nonn AUTHOR N. J. A. Sloane, Jan 11 2021 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 23 09:59 EDT 2021. Contains 345397 sequences. (Running on oeis4.)