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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A202272 Numbers n with k digits such that each sum of 1, 2, ..., k digits of n is substring of n. 2
 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 109, 200, 300, 400, 500, 600, 700, 800, 910, 1000, 1009, 1090, 2000, 3000, 4000, 5000, 6000, 7000, 8000, 9000, 9010, 9100, 10000, 10009, 10090, 10900, 20000, 30000, 40000, 50000, 60000, 70000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Conjecture: sequence contains only - numbers of form k*10^j (j>=0, k>=0), - numbers of form 10X, where X = string of k digits containing one digit 9 and k-1 digits 0 (k>=1), - numbers of form 9Y10Z; where Y = string of k digits 0 (k>=0), Z = string of j digits 0 (j>=0). Subsequence of A052018. LINKS EXAMPLE Number 109 is in sequence becasuse all possible sums of digits 0, 1, 1, 9, 9, 10 are his substrings. CROSSREFS Cf. A052018 (numbers n such that the sum of the digits of n is substring of n). Sequence in context: A236402 A052018 A302768 * A180480 A080459 A093475 Adjacent sequences:  A202269 A202270 A202271 * A202273 A202274 A202275 KEYWORD nonn,base AUTHOR Jaroslav Krizek, Jan 06 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 December 5 12:04 EST 2021. Contains 349557 sequences. (Running on oeis4.)