Search: id:A109950
Results 1-1 of 1 results found.

%I A109950
%S A109950 1,1,2,2,3,4,5,6,8,10,11,14,16,18,23,25,29,32,39,41,49,51,57,66,71,74,
%T A109950 82,92,92,106,105,117,123,129,132,145,153,157,173,173,187,204,214,218,
%U A109950 250,257,266,298,301,329,359,368,370,412,433,433,478,475,508,538,526
%N A109950 Number of partitions of n into parts having in decimal representation 
               mutually no common digits.
%C A109950 A109968(n) <= a(n) <= A000009(n);
%C A109950 A109951(n) = a(n+1) - a(n);
%C A109950 all partitions have not more than 9 parts.
%C A109950 a(n) <= A000009(n), a(n) < A000009(n) for n>10.
%C A109950 a(9876543210) = 1 and a(n) = 0 for n > 9876543210; problem: what is the 
               smallest n such that a(n) = 0?. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), 
               Apr 11 2006
%e A109950 n=20: there are A000009(20)=64 partitions into distinct
%e A109950 parts,
%e A109950 the following 23 partitions contain parts with common digits:
%e A109950 19+1, 17+2+1, 16+3+1, 15+5, 15+4+1, 14+5+1, 14+4+2, 14+3+2+1,
%e A109950 13+6+1, 13+4+3, 13+4+2+1, 12+7+1, 12+6+2, 12+5+2+1, 12+4+3+1,
%e A109950 11+8+1, 11+6+2+1, 11+5+3+1, 10+9+1, 10+7+2+1, 10+6+3+1,
%e A109950 10+5+4+1 and 10+4+3+2+1, therefore a(20) = 64 - 23 = 41.
%Y A109950 Sequence in context: A027196 A100928 A034140 this_sequence A008674 A067596 
               A114098
%Y A109950 Adjacent sequences: A109947 A109948 A109949 this_sequence A109951 A109952 
               A109953
%K A109950 nonn,base
%O A109950 1,3
%A A109950 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 06 2005

Search completed in 0.001 seconds