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.

A273094 a(n) is the smallest number whose divisors contain each 0..9 digit exactly n times.

Original entry on oeis.org

203457869, 206893558, 507083396, 506815954, 102668478970, 895233580, 26475394180, 887692930, 10708845258, 13306408052, 155503137452, 963213572, 803503960576, 40349550036, 203264657940
Offset: 1

Views

Author

Giovanni Resta, May 15 2016

Keywords

Comments

We also have a(18)=18174907880, a(19)=81418065258, a(20)=257678968520, and a(23)=529539876740. The missing terms are all greater than 10^12.

Examples

			a(1)=203457869, whose divisors are 1 and 203457869 itself. a(2)=206893558, whose divisors, i.e., 1, 2, 103446779, and 206893558, contain each digit 2 times.
		

Crossrefs