The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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
 0, 1, 2, 10, 3, 11, 100, 4, 12, 20, 101, 1000, 5, 13, 21, 102, 110, 1001, 10000, 6, 14, 22, 30, 103, 111, 200, 1002, 1010, 10001, 100000, 7, 15, 23, 31, 104, 112, 120, 201, 1003, 1011, 1100, 10002, 10010, 100001, 1000000, 8, 16, 24, 32, 40, 105, 113, 121, 202 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS This is in effect a listing of single-digit (nonnegative) solutions to b + 2c + 3d + 4e + ... = k. LINKS CROSSREFS For n < 10, a(A000070(n))=n+1 and a(A026905(n))=10^(n-1). Cf. A000041, A028897. Sequence in context: A239083 A239084 A322000 * A239136 A239137 A252758 Adjacent sequences:  A061193 A061194 A061195 * A061197 A061198 A061199 KEYWORD nonn AUTHOR Henry Bottomley, Apr 20 2001 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 June 13 11:42 EDT 2021. Contains 344992 sequences. (Running on oeis4.)