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.

A144412 Invert transform of odd nonprime gaps adjusted to be from the set {2,1,0,-1}: b(n)=A067970(n)/2-2; a(n)=Sum[b(n + 1)*a(n - k), {k, 1, n}].

This page as a plain text file.
%I A144412 #5 Jul 16 2015 21:47:17
%S A144412 2,2,4,0,-8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
%T A144412 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
%U A144412 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N A144412 Invert transform of odd nonprime gaps adjusted to be from the set {2,1,0,-1}: b(n)=A067970(n)/2-2; a(n)=Sum[b(n + 1)*a(n - k), {k, 1, n}].
%C A144412 Except for the first five elements, the inverse transform result seems to be zero.
%F A144412 b(n)=A067970(n)/2-2; a(n)=Sum[b(n + 1)*a(n - k), {k, 1, n}].
%t A144412 b = Flatten[Table[If[PrimeQ[2*n + 1], {}, 2*n + 1], {n, 0, 200}]]; c = Table[(b[[n + 1]] - b[[n]])/2 - 2, {n, 1, Length[b] - 1}]; a[0] = c[[1]]; a[n_] := a[n] = Sum[c[[n + 1]]*a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 100}]
%Y A144412 Cf. A067970, A001906.
%K A144412 uned,sign
%O A144412 1,1
%A A144412 _Roger L. Bagula_ and _Gary W. Adamson_, Sep 30 2008