|
|
A087381
|
|
Let Compri(n) be the number obtained by replacing each prime digit (2,3,5,7) of n with a '1' and a composite digit( 0,4,6,8,9) with a '0'. A 1 remains the same. a(n) = Compri(n).
|
|
1
|
|
|
1, 1, 1, 0, 1, 0, 1, 0, 0, 10, 11, 11, 11, 10, 11, 10, 11, 10, 10, 10, 11, 11, 11, 10, 11, 10, 11, 10, 10, 10, 11, 11, 11, 10, 11, 10, 11, 10, 10, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 10, 11, 11, 11, 10, 11, 10, 11, 10, 10, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 10, 11, 11, 11, 10, 11, 10, 11, 10, 10, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,10
|
|
COMMENTS
|
For all numbers using only composite digits (0,4,6,8,9) a(n) = 0. For a 'k' digit number using 1 and/or only prime digits a(n) = (10^k-1)/9.
|
|
LINKS
|
|
|
EXAMPLE
|
a(4206) = 100
a(10235479) = 10111010
|
|
MATHEMATICA
|
Join[{1}, Table[FromDigits[IntegerDigits[n]/.{2->1, 3->1, 4->0, 5->1, 6->0, 7->1, 8->0, 9->0}], {n, 2, 100}]] (* Harvey P. Dale, Jul 12 2020 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|