login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

n written in base equal to the number of distinct prime factors of n and a(1)=0.
0

%I #13 Dec 09 2020 18:10:48

%S 0,11,111,1111,11111,110,1111111,11111111,111111111,1010,11111111111,

%T 1100,1111111111111,1110,1111,1111111111111111,11111111111111111,

%U 10010,1111111111111111111,10100,10101,10110,11111111111111111111111,11000

%N n written in base equal to the number of distinct prime factors of n and a(1)=0.

%C All primes p are written in number-system of base one so rather long strings of 11...111 arise.

%F n in base A001221(n).

%e a(6469693230) = 6469693230.

%e Symbol A to denote "10" first appears at n = 200560490130 = A002110(11).

%t tn[x_] := Fold[nd, 0, x]; Do[s=lf[n];If[Equal[s, 1], Print[tn[Table[1, {i, 1, n}]]]]; If[ !Equal[s, 1], Print[tn[IntegerDigits[n, s]]]], {n, 2, 211}]

%Y Cf. A002110, A001221, A031974 (primes in base one).

%K base,nonn

%O 1,2

%A _Labos Elemer_, Dec 16 2003