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.

A283669 a(n) = q(n-q(n+1)+2) - q(n-q(n)+2) where q(n) = A005185(n).

This page as a plain text file.
%I A283669 #9 Mar 13 2017 22:26:05
%S A283669 0,-1,-1,0,-1,-1,0,0,0,0,-2,0,0,-1,0,-1,-1,0,0,0,0,0,-2,2,0,0,0,0,0,
%T A283669 -1,1,0,-1,1,2,0,-1,0,-1,-1,0,0,0,0,0,0,-4,3,-2,-4,2,2,-2,0,0,-2,0,0,
%U A283669 0,0,0,-1,3,4,-3,1,-1,0,3,4,2,1,-2,-1,2,-2,1,-1,0,1,1,0,-2,1,-1,-1,0,0,0,0
%N A283669 a(n) = q(n-q(n+1)+2) - q(n-q(n)+2) where q(n) = A005185(n).
%H A283669 Altug Alkan, <a href="/A283669/a283669.png">Scatterplot of A283669 for 10^6 terms</a>
%t A283669 q[1] = q[2] = 1; q[n_] := q[n] = q[n - q[n - 1]] + q[n - q[n - 2]]; a[n_]:= q[n - q[n + 1] + 2] - q[n - q[n] + 2] ; Table[a[n], {n, 90}] (* _Indranil Ghosh_, Mar 13 2017 *)
%o A283669 (PARI) a=vector(1001); a[1]=a[2]=1; for(n=3, #a, a[n]=a[n-a[n-1]]+a[n-a[n-2]]); va = vector(1000, n, a[n+2-a[n+1]]-a[n+2-a[n]])
%Y A283669 Cf. A005185.
%K A283669 sign
%O A283669 1,11
%A A283669 _Altug Alkan_, Mar 13 2017