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!)
A154770 a(n+1) = A154771(a(n)) = sum of all distinct "valid substrings" of a(n); a(1)=10 (least nontrivial choice). 4

%I #9 Jan 02 2023 12:30:47

%S 10,11,12,15,21,24,30,33,36,45,54,63,72,81,90,99,108,127,176,283,407,

%T 458,578,733,849,1003,1117,1381,2044,2318,2953,4397,5435,6557,7964,

%U 9989,12279,16572,26426,36970,49970,67738,84716,100181,111599,139413,209606

%N a(n+1) = A154771(a(n)) = sum of all distinct "valid substrings" of a(n); a(1)=10 (least nontrivial choice).

%C "Valid substrings" means all numbers that appear as substring of n (written in decimal system). Starting values < 10 would yield a constant sequence.

%H E. Angelini, <a href="http://list.seqfan.eu/oldermail/seqfan/2009-January/000534.html">Sum of all valid substrings (VS)</a>, SeqFan list, Jan 16 2009

%e a(1) = 10 has { 0, 1, 10 } as distinct substrings,

%e a(2) = 0+1+10 = 11 has { 1, 11 } as distinct substrings,

%e a(3) = 1+11 = 12 has { 1, 2, 12 } as distinct substrings,

%e a(4) = 1+2+12 = 15 has { 1, 5, 15 } as distinct substrings.

%o (PARI) A154770( n=2, a=10 ) = { local(d); while( n--, a=vecsort(concat(vector(d=#Str(a),i,vector(d,j,a%10^j)+(d--&!a\=10))),NULL,8);a*=vector(#a,i,1)~); a }

%o print1(a=10);for(i=1,50,print1("," a=A154770(,a)))

%Y Cf. A004207, A154771.

%K base,easy,nonn

%O 1,1

%A _Eric Angelini_ and _M. F. Hasler_, Jan 16 2009

%E The word "distinct" added to definition Jan 19 2009 at the suggestion of _Hugo van der Sanden_.

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 May 3 13:17 EDT 2024. Contains 372212 sequences. (Running on oeis4.)