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);
From Reinhard Zumkeller, Sep 18 2009: (Start)
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
KEYWORD
AUTHOR
Reinhard Zumkeller, Jul 08 2003
STATUS
approved