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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A131367 Smallest number that can be written in exactly n ways as a sum of distinct repdigits of its decimal digits. 2

%I

%S 10,1,197,1198,1098,1236,1235,1492,1384,1576,1976,4713,1347,7514,3712,

%T 7641,8716,11967,5614,12377,3912,12337,10978,3821,3812,14367,15946,

%U 12983,10879,12798,14695,13429,13822,13821,13820,12439,13697,16879,12698,13946,13694

%N Smallest number that can be written in exactly n ways as a sum of distinct repdigits of its decimal digits.

%C A131364(a(n)) = n and A131364(m) <> n for m<a(n).

%H Lars Blomberg, <a href="/A131367/b131367.txt">Table of n, a(n) for n = 0..2000</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Repdigit.html">Repdigit</a>

%e a(2)=197: A131364(197)=#{111+77+9,99+77+11+9+1}=2;

%e a(3)=1298:

%e A131364(1298)=#{1111+99+88,999+111+99+88+1,888+222+99+88+1}=3.

%K nonn,base

%O 0,1

%A _Reinhard Zumkeller_, Jul 03 2007

%E a(25)-a(40) from _Lars Blomberg_, May 11 2015

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 19 09:36 EDT 2021. Contains 348074 sequences. (Running on oeis4.)