cp's OEIS Frontend

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.

A061828 Number of partitions of n into parts using the digits of n.

This page as a plain text file.
%I A061828 #6 Dec 05 2013 19:54:52
%S A061828 1,1,1,1,1,1,1,1,1,2,2,8,6,5,5,4,4,4,4,2,17,2,5,8,4,6,3,5,3,2,21,9,2,
%T A061828 4,4,8,3,3,6,2,23,17,6,2,4,5,3,8,3,2,27,11,7,5,2,3,3,3,3,2,28,21,17,9,
%U A061828 4,2,3,4,5,2,30,12,7,5,4,3,2,3,3,2,32,23,7,17,4,6,3,2,3,2,33,13,21,6,5,9
%N A061828 Number of partitions of n into parts using the digits of n.
%e A061828 a(20) = 2, the only partitions permitted are 20 and 2+2+2...ten times. a(21) = 16, 5 more than A061827 as the partition 12 + 2+2+2+2+1 etc. ( 5 in number) are also considered.
%e A061828 a(21) = 17. The allowed parts are 1, 2, 12 and 21. The 17 sums are 21, 12+2+2+2+2+1, 12+2+2+2+1+1+1, 12+2+2+1+1+1+1+1, 12+2+1+1+1+1+1+1+1, 12+1+1+1+1+1+1+1+1+1+1 and 11 more involving only 1 and 2.
%Y A061828 Cf. A061827.
%K A061828 nonn,base,easy
%O A061828 1,10
%A A061828 _Amarnath Murthy_, May 28 2001
%E A061828 More terms from _David Wasserman_, Sep 01 2002