This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A147706 #4 Mar 30 2012 18:51:00 %S A147706 1,1,2,2,3,4,5,6,8,10,11,15,16,20,25,28,32,39,46,50,62,66,78,93,101, %T A147706 112,132,150,161,192,202,232,268,287,312,361,400,425,497,516,582,658, %U A147706 698,748,858,932,982,1135,1164,1296,1443,1519,1610,1845,1968,2059,2360,2395 %N A147706 Number of partitions of n into parts having distinct digital roots (A010888). %C A147706 a(n) <= A000009(n). %C A147706 Likely a duplicate of A114098. [From _R. J. Mathar_, Dec 13 2008] %e A147706 A000009(16) = 32, in which the following 4 partitions %e A147706 contain parts with common digital roots: %e A147706 12 + 3 + 1, 11 + 3 + 2, 10 + 5 + 1 and 10 + 3 + 2 + 1, %e A147706 therefore a(16) = 32 - 4 = 28. %Y A147706 A114102, A116371, A116372, A116373, A116374, A116375, A116376, A116377, A116378, A114099. %K A147706 base,nonn %O A147706 1,3 %A A147706 _Reinhard Zumkeller_, Nov 11 2008