The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A043290 Maximal run length in base 16 representation of n. 15
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,17
LINKS
MATHEMATICA
A043290[n_]:=Max[Map[Length, Split[IntegerDigits[n, 16]]]]; Array[A043290, 100] (* Paolo Xausa, Sep 27 2023 *)
PROG
(PARI) A043290(n, b=16)={my(m, c=1); while(n>0, n%b==(n\=b)%b && c++ && next; m=max(m, c); c=1); m} \\ Use optional 2nd arg to get sequences A043276 through A043289. - M. F. Hasler, Jul 23 2013
(Python)
from itertools import groupby
def A043290(n): return max(len(list(g)) for k, g in groupby(hex(n)[2:])) # Chai Wah Wu, Mar 09 2023
CROSSREFS
Sequence in context: A327103 A290105 A191898 * A356153 A194333 A203640
KEYWORD
nonn,base
AUTHOR
EXTENSIONS
More terms from Antti Karttunen, Sep 21 2018
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 May 25 04:52 EDT 2024. Contains 372782 sequences. (Running on oeis4.)