A045799 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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”).

Other ways to Give

A045799

In the list of divisors of n (in binary), each digit 0-1 appears equally often.

100, 10001, 10100, 11000, 100100, 1000011, 1001001, 1001010, 1001100, 1010010, 1011000, 1100001, 1100100, 1101000, 1110000, 10101010, 11001100, 11011000, 11110000, 100000111, 100001101, 100010101, 100010110, 100011001, 100011100

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

The corresponding decimal values of the terms are 4, 17, 20, 24, 36, 67, 73, 74, 76, 82, 88, 97, 100, 104, 112, 170, 204, 216, 240, 263, 269, 277, 278, 281, 284, ... - Amiram Eldar, Sep 08 2019

LINKS

Amiram Eldar, Table of n, a(n) for n = 1..10000

N. Nomoto, In the list of divisors of n,... [Dead link]

EXAMPLE

E.g. divisors of 10100 are (1, 10, 100, 101, 1010, 10100); the numbers of digits (0-1) are [ 0(9),1(9) ].

MATHEMATICA

fQ[v_] := Length[v] == 2 && v[[1]] == v[[2]]; aQ[n_] := fQ[(Tally @ Flatten @ Join @ IntegerDigits[Divisors[n], 2])[[;; , 2]]]; FromDigits /@ IntegerDigits[Select[ Range[284], aQ], 2] (* Amiram Eldar, Sep 08 2019 *)

CROSSREFS

Cf. A038564, A038565, A045810.

Sequence in context: A029794 A029801 A098608 * A096885 A267449 A266752

Adjacent sequences: A045796 A045797 A045798 * A045800 A045801 A045802

KEYWORD

easy,nonn,base

AUTHOR

Naohiro Nomoto

STATUS

approved