login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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

%I #7 Mar 30 2012 19:00:28

%S 4,6,8,9,10,20,30,40,50,60,70,80,90,100,200,300,400,500,600,700,800,

%T 910,1000,1090,2000,3000,4000,5000,6000,7000,8000,9000,9010,9100,

%U 10000,10090,10900,20000,30000,40000,50000,60000,70000,80000,90000,90010,90100,91000

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

%C Complement of A205529 with respect to A202272.

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

%Y Cf. A205529, A202272.

%K nonn,base

%O 1,1

%A _Jaroslav Krizek_, Jan 28 2012

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 19:06 EDT 2024. Contains 371962 sequences. (Running on oeis4.)