

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)




