|
Search: id:A090103
|
|
|
| A090103 |
|
n written in base equal to the number of distinct prime factors of n and a[1]=0;. |
|
+0
2
|
|
| 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; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
n in base A001221[n].
|
|
EXAMPLE
|
a[6469693230]=6469693230: Symbol A to denote "10" first appears at n=200560490130=A002110[11] all primes p are written in number-system of base one so rather long strings of 11...111 arise.
|
|
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.
Sequence in context: A039988 A083440 A138144 this_sequence A061851 A138145 A134962
Adjacent sequences: A090100 A090101 A090102 this_sequence A090104 A090105 A090106
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Dec 16 2003
|
|
|
Search completed in 0.002 seconds
|
