cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

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

Original entry on oeis.org

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
Offset: 1

Views

Author

Keywords

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

Examples

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

Crossrefs

Programs

  • 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 *)
Showing 1-1 of 1 results.