login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087380 Let Pricom(n) be defined as the number obtained by replacing each prime digit (2,3,5,7) of n by a '0' and a composite digit( 0,4,6,8,9) by 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; 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.

EXAMPLE

a(4206) = 1011

a(10235479) = 11000101.

CROSSREFS

Cf. A087381.

Sequence in context: A061186 A135684 A126610 * A152986 A087994 A100755

Adjacent sequences:  A087377 A087378 A087379 * A087381 A087382 A087383

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 09 2003

EXTENSIONS

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), May 25 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 10:24 EST 2012. Contains 205614 sequences.