|
|
A087380
|
|
Let Pricom(n) be defined as the number obtained by replacing each prime digit (2,3,5,7) of n with a '0' and a composite digit (0,4,6,8,9) with a '1' . A 1 remains the same. a(n) = Pricom(n).
|
|
1
|
|
|
1, 0, 0, 1, 0, 1, 0, 1, 1, 11, 11, 10, 10, 11, 10, 11, 10, 11, 11, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 11, 11, 10, 10, 11, 10, 11, 10, 11, 11, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 11, 11, 10, 10, 11, 10, 11, 10, 11, 11, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 11, 11, 10, 10, 11, 10, 11, 10
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,10
|
|
COMMENTS
|
For all numbers using only prime digits a(n) = 0. For a 'k' digit number using 1 and/or only composite digits a(n) = (10^k-1)/9.
|
|
LINKS
|
|
|
EXAMPLE
|
a(4206) = 1011
a(10235479) = 11000101.
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|