Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Jul 13 2013 12:03:29
%S 1,1,1,1,1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,1,
%T 0,0,1,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,
%U 0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0
%N Number of partitions of n into distinct repdigits of digits of n.
%C a(A131365(n)) = 0; a(A131366(n)) > 0;
%C a(A131367(n)) = n and a(m) <> n for m < A131367(n).
%H Reinhard Zumkeller, <a href="/A131364/b131364.txt">Table of n, a(n) for n = 0..10000</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Repdigit.html">Repdigit</a>
%e a(11) = #{11} = 1;
%e a(12) = #{11+1} = 1;
%e a(22) = #{22} = 1;
%e a(24) = #{22+2} = 1;
%e a(197) = #{111+77+9, 99+77+11+9+1} = 2;
%e a(198) = #{99+88+11} = 1.
%o (Haskell)
%o a131364 n = p [r | r <- tail a010785_list, head (show r) `elem` show n] n
%o where p _ 0 = 1
%o p (k:ks) m = if m < k then 0 else p ks (m - k) + p ks m
%o -- _Reinhard Zumkeller_, Dec 10 2011
%Y Cf. A131361, A088670.
%K nonn,base
%O 0
%A _Reinhard Zumkeller_, Jul 03 2007, Jul 20 2007
%E a(0)=1 added and offset adjusted by _Reinhard Zumkeller_, Dec 10 2011