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.

A276810 Numbers n such that A045876(n) has distinct decimal digits.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 39, 48, 49, 57, 58, 59, 67, 68, 69, 75, 76, 78, 79, 84, 85, 86, 87, 89, 93, 94, 95, 96, 97, 98, 149, 158, 167, 176, 185, 194, 199, 239, 248, 257, 275, 284, 289, 293, 298, 329, 347, 356, 365, 374, 379, 388, 392, 397, 419, 428, 437, 469, 473, 478, 482
Offset: 1

Views

Author

Altug Alkan, Sep 18 2016

Keywords

Comments

This sequence contains 146 elements. The largest is 991. No more terms below 10^10. As A045876(n) >= n, for all n >= 10^10, A045876(n) will have at least one digit not distinct. - David A. Corneth, Sep 19 2016

Examples

			289 is a term because 289+298+829+892+928+982 = 4218 has distinct decimal digits.
		

Crossrefs

Programs

Extensions

Clarified comment. - Harvey P. Dale, Apr 30 2022