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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086066 a(n) = Sum_{d in D(n)} 2^d, where D(n) = set of digits of n in decimal representation. 7
1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 3, 2, 6, 10, 18, 34, 66, 130, 258, 514, 5, 6, 4, 12, 20, 36, 68, 132, 260, 516, 9, 10, 12, 8, 24, 40, 72, 136, 264, 520, 17, 18, 20, 24, 16, 48, 80, 144, 272, 528, 33, 34, 36, 40, 48, 32, 96, 160, 288, 544, 65, 66, 68, 72, 80 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

For bitwise logical operations AND and OR:

a(m) = (a(m) AND a(n)) iff D(m) is a subset of D(n),

(a(m) AND a(n)) = 0 iff D(m) and D(n) are disjoint,

a(m) = (a(m) OR a(n)) iff D(n) is a subset of D(m),

a(m) = a(n) iff D(m) = D(n);

A086067(n) = A007088(a(n)).

From Reinhard Zumkeller, Sep 18 2009: (Start)

a(A052382(n)) mod 2 = 0; a(A011540(n)) mod 2 = 1;

for n > 0: a(A000004(n))=1, a(A000042(n))=2, a(A011557(n))=3, a(A002276(n))=4, a(A111066(n))=6, a(A002277(n))=8, a(A002278(n))=16, a(A002279(n))=32, a(A002280(n))=64, a(A002281(n))=128, a(A002282(n))=256, a(A002283(n))=512;

a(n) <= 1023. (End)

LINKS

Nathaniel Johnston, Table of n, a(n) for n = 0..10000

EXAMPLE

n=242, D(242) = {2,4}: a(242) = 2^2 + 2^4 = 20.

MAPLE

A086066 := proc(n) local d: if(n=0)then return 1: fi: d:=convert(convert(n, base, 10), set): return add(2^d[j], j=1..nops(d)): end: seq(A086066(n), n=0..64); # Nathaniel Johnston, May 31 2011

CROSSREFS

Sequence in context: A085940 A061509 A189398 * A263327 A085941 A054842

Adjacent sequences:  A086063 A086064 A086065 * A086067 A086068 A086069

KEYWORD

nonn,base,easy,look

AUTHOR

Reinhard Zumkeller, Jul 08 2003

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 17 19:10 EDT 2019. Contains 324198 sequences. (Running on oeis4.)