A043281 -id:A043281 - cp's OEIS frontend

A043290 Maximal run length in base 16 representation of n.

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

Offset: 1

Clark Kimberling

Antti Karttunen, Table of n, a(n) for n = 1..65537

Cf. A043276, A043277, A043278, A043279, A043280, A043281, A043282, A043283, A043284, A043285, A043286, A043287, A043288, A043289 for base-2 to base-15 analogs.

A043290[n_]:=Max[Map[Length,Split[IntegerDigits[n,16]]]];Array[A043290,100] (* Paolo Xausa, Sep 27 2023 *)

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

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

More terms from Antti Karttunen, Sep 21 2018

A368330 The number of terms of A054743 that are unitary divisors of n.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1

Offset: 1

Amiram Eldar, Dec 21 2023

First differ from A043281 at n = 49.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A034444, A054743, A207481, A368328, A368329, A368331, A368334.

Cf. A043281.

f[p_, e_] := If[e <= p, 1, 2]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]

a(n) = {my(f = factor(n)); prod(i = 1, #f~, if(f[i,2] <= f[i,1], 1, 2));}

Multiplicative with a(p^e) = 1 if e <= p, and a(p^e) = 2 if e > p.
a(n) = A034444(A368329(n)).
a(n) >= 1, with equality if and only if n is in A207481.
a(n) <= A034444(n), with equality if and only if n is in A054743.
Dirichlet g.f.: zeta(s) * Product_{p prime} (1 + 1/p^((p+1)*s)).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Product_{p prime} (1 + 1/p^(p+1)) = 1.13896197534988330925... .

A043287 Maximal run length in base-13 representation of n.

Original entry on oeis.org

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, 2, 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, 2, 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, 2, 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, 2, 1, 1, 1, 1, 1

Offset: 1

Clark Kimberling

Antti Karttunen, Table of n, a(n) for n = 1..65537

Cf. A043276, A043277, A043278, A043279, A043280, A043281, A043282, A043283, A043284, A043285, A043286, A043288, A043289, A043290 for base-2 to base-16 analogs.

A043287[n_]:=Max[Map[Length,Split[IntegerDigits[n,13]]]];Array[A043287,100] (* Paolo Xausa, Sep 27 2023 *)

A043287(n,b=13)={my(m,c=1);while(n>0,n%b==(n\=b)%b&&c++&&next;m=max(m,c);c=1);m} \\ M. F. Hasler, Jul 23 2013

More terms from Antti Karttunen, Sep 21 2018

A043288 Maximal run length in base-14 representation of n.

Original entry on oeis.org

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, 2, 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, 2, 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, 2, 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, 2

Offset: 1

Clark Kimberling

Antti Karttunen, Table of n, a(n) for n = 1..65537

Cf. A043276, A043277, A043278, A043279, A043280, A043281, A043282, A043283, A043284, A043285, A043286, A043287, A043289, A043290 for base-2 to base-16 analogs.

A043288[n_]:=Max[Map[Length,Split[IntegerDigits[n,14]]]];Array[A043288,100] (* Paolo Xausa, Sep 27 2023 *)

A043288(n,b=14)={my(m,c=1);while(n>0,n%b==(n\=b)%b&&c++&&next;m=max(m,c);c=1);m} \\ M. F. Hasler, Jul 23 2013

More terms from Antti Karttunen, Sep 21 2018

cp's OEIS Frontend

A043290 Maximal run length in base 16 representation of n.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Python

Extensions

A368330 The number of terms of A054743 that are unitary divisors of n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A043287 Maximal run length in base-13 representation of n.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A043288 Maximal run length in base-14 representation of n.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Extensions