cp's OEIS Frontend

A045634 Number of ways in which n can be partitioned as a sum of a square and cube.

%I A045634 #23 Aug 02 2018 09:33:31
%S A045634 1,2,1,0,1,1,0,0,1,2,1,0,1,0,0,0,1,2,0,0,0,0,0,0,1,1,1,1,1,0,0,1,0,1,
%T A045634 0,0,2,1,0,0,0,0,0,1,1,0,0,0,0,1,1,0,1,0,0,0,0,1,0,0,0,0,0,1,2,2,0,0,
%U A045634 1,0,0,0,1,1,0,0,1,0,0,0,1,1,1,0,0,0,0,0,0,2,0,1,0,0,0,0,0,0,0,0,2
%N A045634 Number of ways in which n can be partitioned as a sum of a square and cube.
%C A045634 a(A022550(n))=0; a(A179509(n))=1; a(A022549(n))>0; a(A060861(n))=n. [From _Reinhard Zumkeller_, Jul 17 2010]
%H A045634 T. D. Noe, <a href="/A045634/b045634.txt">Table of n, a(n) for n = 0..10000</a>
%e A045634 a(9)=2 because 9=2^3+1^2 and 9=3^2+0^3.
%p A045634 M:=100; M2:=M^2; t0:=array(0..M2);
%p A045634 for i from 0 to M2 do t0[i]:=0; od:
%p A045634 for a from 0 to M do for b from 0 to M do
%p A045634 i:=a^2+b^3; if i <= M2 then t0[i]:=t0[i]+1; fi; od: od:
%p A045634 [seq(t0[i],i=0..M2)];
%t A045634 max = 100; Clear[a]; a[_] = 0;
%t A045634 Do[n = i^2 + j^3; a[n] += 1, {i, 0, Sqrt[max]}, {j, 0, max^(1/3)}];
%t A045634 Table[a[n], {n, 0, max}] (* _Jean-François Alcover_, Aug 02 2018 *)
%Y A045634 Cf. A022549, A060861, A135910, A135911, A135912.
%K A045634 nonn
%O A045634 0,2
%A A045634 _Felice Russo_
%E A045634 More terms from _Erich Friedman_