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.

A209930 Numbers n such that largest digit of all divisors of n is 1.

Original entry on oeis.org

1, 11, 101, 1111, 10111, 101111, 1011001, 1100101, 10010101, 10011101, 10100011, 10101101, 10110011, 10111001, 11000111, 11100101, 11110111, 11111101, 100100111, 100111001, 101001001, 101001011, 101100011, 101101111, 101111011, 101111111, 110010101
Offset: 1

Views

Author

Jaroslav Krizek, Mar 20 2012

Keywords

Comments

Also numbers n such that largest digit of concatenation of all divisors (A037278) of n is 1.
What is the smallest n with a(n) <> A203304(n)? - Alois P. Heinz, Jul 16 2014

Examples

			Number  1111 is in sequence because largest digit of all divisors of 1111 (1, 11, 101, 1111) is 1.
		

Crossrefs

Cf. A209928 (largest digit of all divisors of n).
Cf. A203304.

Programs

  • Mathematica
    t = {}; n = 0; While[Length[t] < 30, n++; m = FromDigits[IntegerDigits[n, 2]]; If[Max[Union[Flatten[IntegerDigits[Divisors[m]]]]] <= 1, AppendTo[t, m]]]; t (* T. D. Noe, Jan 30 2013 *)

Extensions

Corrected by Jaroslav Krizek, Jan 29 2013