OFFSET
1,1
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
a(5) = 10 is a term because 10 has two runs (1 and 0) and two prime factors, 2 and 5.
MAPLE
filter:= proc(n) local L; L:= convert(n, base, 10); nops(L) - numboccur(0, L[2..-1]-L[1..-2]) = numtheory:-bigomega(n) end proc:
select(filter, [$1..1000]);
MATHEMATICA
A379929Q[n_] := PrimeOmega[n] == Length[Split[IntegerDigits[n]]];
Select[Range[300], A379929Q] (* Paolo Xausa, Jan 08 2025 *)
PROG
(Python)
from sympy import primeomega
def ok(n): return primeomega(n) == len(s:=str(n)) - sum(1 for i in range(1, len(s)) if s[i-1] == s[i])
print([k for k in range(1, 232) if ok(k)]) # Michael S. Branicky, Jan 08 2025
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Robert Israel, Jan 06 2025
STATUS
approved