The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A205530 Composite numbers n with k digits such that each sum of 1 to k digits of n is substring of n. 1
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Complement of A205529 with respect to A202272. LINKS EXAMPLE 910 is in sequence because all possible sums of digits 0, 1, 1, 9, 9, 10, 10 are substrings of 910. CROSSREFS Cf. A205529, A202272. Sequence in context: A004716 A212372 A320726 * A100373 A211302 A123938 Adjacent sequences:  A205527 A205528 A205529 * A205531 A205532 A205533 KEYWORD nonn,base AUTHOR Jaroslav Krizek, Jan 28 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 17 18:14 EST 2020. Contains 330987 sequences. (Running on oeis4.)