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.

A205530 Composite numbers n with k digits such that each sum of 1 to k digits of n is substring of n.

Original entry on oeis.org

4, 6, 8, 9, 10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 200, 300, 400, 500, 600, 700, 800, 910, 1000, 1090, 2000, 3000, 4000, 5000, 6000, 7000, 8000, 9000, 9010, 9100, 10000, 10090, 10900, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 90010, 90100, 91000
Offset: 1

Views

Author

Jaroslav Krizek, Jan 28 2012

Keywords

Comments

Complement of A205529 with respect to A202272.

Examples

			910 is in sequence because all possible sums of digits 0, 1, 1, 9, 9, 10, 10 are substrings of 910.
		

Crossrefs