This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A061196 If n=sum(c_i*10^i) then let b(n)=sum(c_i*(i+1)). Order the integers by b(n) and then n. 0

%I

%S 0,1,2,10,3,11,100,4,12,20,101,1000,5,13,21,102,110,1001,10000,6,14,

%T 22,30,103,111,200,1002,1010,10001,100000,7,15,23,31,104,112,120,201,

%U 1003,1011,1100,10002,10010,100001,1000000,8,16,24,32,40,105,113,121,202

%N If n=sum(c_i*10^i) then let b(n)=sum(c_i*(i+1)). Order the integers by b(n) and then n.

%C This is in effect a listing of single-digit (nonnegative) solutions to b + 2c + 3d + 4e + ... = k.

%Y For n < 10, a(A000070(n))=n+1 and a(A026905(n))=10^(n-1). Cf. A000041, A028897.

%K nonn

%O 0,3

%A _Henry Bottomley_, Apr 20 2001

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 September 17 17:32 EDT 2019. Contains 327136 sequences. (Running on oeis4.)