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!)
 A090103 n written in base equal to the number of distinct prime factors of n and a(1)=0. 0
 0, 11, 111, 1111, 11111, 110, 1111111, 11111111, 111111111, 1010, 11111111111, 1100, 1111111111111, 1110, 1111, 1111111111111111, 11111111111111111, 10010, 1111111111111111111, 10100, 10101, 10110, 11111111111111111111111, 11000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS All primes p are written in number-system of base one so rather long strings of 11...111 arise. LINKS FORMULA n in base A001221(n). EXAMPLE a(6469693230) = 6469693230. Symbol A to denote "10" first appears at n = 200560490130 = A002110(11). MATHEMATICA 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}] CROSSREFS Cf. A002110, A001221, A031974 (primes in base one). Sequence in context: A284419 A283849 A283604 * A061851 A247552 A138145 Adjacent sequences:  A090100 A090101 A090102 * A090104 A090105 A090106 KEYWORD base,nonn AUTHOR Labos Elemer, Dec 16 2003 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 May 17 20:44 EDT 2021. Contains 343990 sequences. (Running on oeis4.)