The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors 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 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
Cf. A087381.
Sequence in context: A300289 A321108 A126610 * A152986 A252838 A366717
KEYWORD
base,nonn
AUTHOR
Amarnath Murthy, Sep 09 2003
EXTENSIONS
More terms from David Wasserman, May 25 2005
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 12 15:32 EDT 2024. Contains 373331 sequences. (Running on oeis4.)