Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 Mar 31 2012 13:21:10
%S 0,5,10,15,20,21,30,31,40,42,45,47,60,61,62,63,80,84,85,90,94,95,120,
%T 122,124,125,126,127,160,165,168,170,173,175,180,181,188,189,190,191,
%U 240,244,245,248,250,252,253,254,255,320,330,336,340,341,346,350,351
%N Integers i such that 13*i = A048720bi(21,i).
%C Here * stands for ordinary multiplication and A048720 is the carryless (GF(2)[X]) multiplication.
%C a(n) appears to be the set of all n that can be expressed as x OR 4x for the bitwise OR operation. [From _Gary Detlefs_ Dec 20 2010]
%H <a href="/index/Con#CongruCrossDomain">Index entries for sequences defined by congruent products between domains N and GF(2)[X]</a>
%Y Row 13 of A115872. Cf. A048717, A115767, A115770. Superset of A115774 ? A115776 gives the terms which are not in A115774. A115773 shows this sequence in binary.
%Y Cf. A178891
%K nonn
%O 0,2
%A _Antti Karttunen_, Jan 30 2006