%I A048927
%S A048927 157,220,227,246,253,260,267,279,283,286,305,316,323,342,344,361,368,
%T A048927 377,379,384,403,410,435,440,442,468,475,487,494,501,523,530,531,549,
%U A048927 562,568,586,592,594,595,599,602,621,625,640,647,657,658,683,703,710
%N A048927 Numbers that are the sum of 5 positive cubes in exactly 2 ways.
%H A048927 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               CubicNumber.html">Link to a section of The World of Mathematics.</
               a>
%o A048927 (Python: replace leading dots by blanks):
%o A048927 .def ways (n, left=5, last=1):
%o A048927 .. a=last; a3=a*a*a; c=0
%o A048927 .. while a3<=n-left+1:
%o A048927 .... if left>1:
%o A048927 ...... c=c+ways(n-a3, left-1, a)
%o A048927 .... elif a3==n:
%o A048927 ...... c=c+1
%o A048927 .... a=a+1; a3=a*a*a
%o A048927 .. return c
%o A048927 .for n in range (1,1000):
%o A048927 .. c=ways(n)
%o A048927 .. if c==2:
%o A048927 .... print n,
%o A048927 (PARI) waycount(n,numcubes,imax)={if(numcubes==0,if(n==0,1,0),sum(i=1,
               imax,waycount(n-i^3,numcubes-1,i)))};isA048927(n)=(waycount(n,5,floor(n^(1/
               3)))==2); [From Michael Porter (michael_b_porter(AT)yahoo.com), Sep 
               27 2009]
%Y A048927 Cf. A003328, A048926.
%Y A048927 Sequence in context: A096704 A140035 A007356 this_sequence A142063 A151739 
               A142231
%Y A048927 Adjacent sequences: A048924 A048925 A048926 this_sequence A048928 A048929 
               A048930
%K A048927 nonn
%O A048927 1,1
%A A048927 Eric Weisstein (eric(AT)weisstein.com)
%E A048927 More terms from Walter Hofmann (walterh(AT)gmx.de), Jun 01 2000