[seqfan] Re: Convert/concatenate/divide

[jnthn stdhr]

It is https://oeis.org/draft/A303492.

On Tue, Apr 24, 2018 at 7:19 PM, Neil Sloane <njasloane at gmail.com> wrote:

> > Should I add this?
>
> Yes, please do!
>
> Best regards
> Neil
>
> Neil J. A. Sloane, President, OEIS Foundation.
> 11 South Adelaide Avenue, Highland Park, NJ 08904, USA.
> Also Visiting Scientist, Math. Dept., Rutgers University, Piscataway, NJ.
> Phone: 732 828 6098; home page: http://NeilSloane.com
> Email: njasloane at gmail.com
>
>
> On Tue, Apr 24, 2018 at 3:18 PM, jnthn stdhr <jstdhr at gmail.com> wrote:
>
> > For n > 0, covert n to its binary representation b, then let x equal the
> > concatenation of the decimal values of each power of two <= n muliplied
> by
> > its associated bit in b. If n divides x  a(n) = n. For example, with
> n=18,
> > b=10010, x = concat(16,0,0,2,0) = 160020, and 160020 / 18 = 8890, so 18
> is
> > in the sequence. The sequence begins:  1, 2, 3, 4, 6, 8, 9, 10, 12, 16,
> 18,
> > 20, 24, 27, 30, 32, 36, 40, 48, 60, 64, 72, 80, 90, 96, 100, 112, 120,
> 128,
> > 130, 144, 160, 180, 184, 190, 192, 200,...
> >
> > This first differs from A002183 (Number of divisors of n-th highly
> > composite number.) a(14)=27. 84 is the first number that is a term in
> A2183
> > that is not in this sequence.
> >
> > Should I add this?
> >
> > -Jonathan
> >
> > --
> > Seqfan Mailing list - http://list.seqfan.eu/
> >
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/
>