id:A087381 - OEIS Search Results

Search: id:A087381

Displaying 1-1 of 1 results found.

page 1

Let Compri(n) be the number obtained by replacing each prime digit (2,3,5,7) of n by a '1' and a composite digit( 0,4,6,8,9) by a '0' . A 1 remains the same. a(n) = Compri(n).

+0
2

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; listen)

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research