|
%I #18 May 25 2016 22:01:24
%S 0,1,0,1,2,0,0,1,3,4,0,0,1,1,1,6,6,0,0,2,0,1,1,2,8,9,0,1,1,0,2,0,1,1,
%T 4,12,12,2,0,0,1,1,0,2,0,2,1,7,15,17,0,0,2,0,0,1,1,1,2,0,2,1,10,19,22,
%U 0,1,0,0,2,0,1,1,1,1,2,0,2,2,14
%N Start with a(0) = 0. Thereafter a(n) is the number of m < n with the property that a(m) + n is a perfect square.
%H Peter Kagey, <a href="/A273185/b273185.txt">Table of n, a(n) for n = 0..10000</a>
%e a(3) = 1 because 3 + a(1) is a perfect square.
%e a(4) = 2 because 4 + a(0) and 4 + a(2) are perfect squares.
%t a = {0}; Do[AppendTo[a, Count[a + n, k_ /; IntegerQ@ Sqrt@ k]], {n, 79}]; a (* _Michael De Vlieger_, May 25 2016 *)
%o (Java)
%o int n = 1000;
%o int[] terms = new int[n];
%o for (int i = 0; i < n; i++) {
%o for (int j = 0; j < i; j++) {
%o if (Math.sqrt(i+terms[j]) == Math.floor(Math.sqrt(i+terms[j]))) {
%o terms[i]++;
%o }
%o }
%o System.out.print(terms[i] + ", ");
%o }
%Y Cf. A273190.
%K easy,nonn
%O 0,5
%A _Alec Jones_, May 17 2016
|
