|
%I #14 Apr 28 2020 10:43:24
%S 1,1,1,1,1,1,2,0,0,3,1,1,0,1,2,1,1,0,3,0,1,2,0,1,1,2,0,2,1,1,2,1,0,0,
%T 1,1,4,0,1,2,0,1,0,1,2,3,0,0,1,1,1,2,1,1,2,1,1,0,2,0,2,0,0,3,1,1,2,0,
%U 0,4,1,1,0,1,1,0,1,1,2,1,1,3,0,1,2,0,2,0,0,0,4,2,0,2,1,1,0,0,0,2,1,2,2,1,1
%N Number of ways n can be expressed as the sum of a square and a triangular number.
%C It is assumed here that 0 is a square but not a triangular number. - _Amiram Eldar_, Dec 08 2019
%C The greedy inverse (positions of the first occurrence of n) is 1, 7, 10, 37, 136, 235, 1225, 631, 2116, 4789, 11026, 3997, 148240, 19045, 20827, 25876, ... - _R. J. Mathar_, Apr 28 2020
%H Amiram Eldar, <a href="/A082660/b082660.txt">Table of n, a(n) for n = 1..10000</a>
%e a(631) = 8 because:
%e 1. 631 = 6 + 625
%e 2. 631 = 55 + 576
%e 3. 631 = 190 + 441
%e 4. 631 = 231 + 400
%e 5. 631 = 406 + 225
%e 6. 631 = 435 + 196
%e 7. 631 = 595 + 36
%e 8. 631 = 630 + 1
%p A082660 := proc(n)
%p local a,tidx,t;
%p a := 0 ;
%p for tidx from 1 do
%p t := A000217(tidx) ;
%p if t > n then
%p break;
%p end if;
%p if issqr(n-t) then
%p a := a+1 ;
%p end if;
%p end do:
%p a ;
%p end proc: # _R. J. Mathar_, Apr 28 2020
%t a[n_] := Length @ Solve[x^2 + y (y + 1)/2 == n && x >= 0 && y > 0, {x, y}, Integers]; Array[a, 100] (* _Amiram Eldar_, Dec 08 2019 *)
%Y Cf. A000217, A000290, A082657, A082658, A082659.
%K nonn
%O 1,7
%A _Jason Earls_, May 17 2003
|
