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.
%I A168464 #14 Feb 03 2019 01:53:12
%S A168464 0,1,1,5,2,5,1,5,5,1,31,29,13,29,31,1,31,14,14,31,1,41,43,106,97,106,
%T A168464 43,41,1,41,22,101,101,22,41,1,31,29,106,109,97,109,106,29,31,1,31,14,
%U A168464 113,101,101,113,14,31,1,61,71,158,161,1271,199,1271,161,158,71,61,1,61,38
%N A168464 a(n) = A085738(n) - A085737(n).
%C A168464 The corresponding sum is in A168140.
%C A168464 The sequence contains negative numbers starting in row T(15,.) of the triangle.
%e A168464 As a triangle, sequence begins:
%e A168464 0;
%e A168464 1, 1;
%e A168464 5, 2, 5;
%e A168464 1, 5, 5, 1;
%e A168464 31, 29, 13, 29, 31;
%e A168464 1, 31, 14, 14, 31, 1;
%e A168464 ...
%p A168464 T := proc(n,k) option remember; if k = 0 then (-1)^n*bernoulli(n) ; elif k > n/2 then procname(n,n-k) ; else procname(n-1,k-1)-procname(n,k-1) ; end if; end proc:
%p A168464 A085737 := proc(n,k) numer(T(n,k)) ; end proc:
%p A168464 A085738 := proc(n,k) denom(T(n,k)) ; end proc:
%p A168464 for n from 0 to 15 do for k from 0 to n do printf("%d,",A085738(n,k)-A085737(n,k)) ; end do: end do: # _R. J. Mathar_, Mar 21 2010
%o A168464 (PARI) t(n,k) = if (k==0, (-1)^n*bernfrac(n), t(n-1, k-1) - t(n, k-1));
%o A168464 T(n,k) = my(tnk=t(n,k)); denominator(tnk) - numerator(tnk);
%o A168464 tabl(nn) = for (n=0, nn, for (k= 0, n, print1(T(n,k), ", ")); print); \\ _Michel Marcus_, Feb 01 2019
%Y A168464 Cf. A085737, A085738, A168140.
%K A168464 sign,tabl
%O A168464 0,4
%A A168464 _Paul Curtz_, Nov 26 2009
%E A168464 Offset set to zero, sequence extended by _R. J. Mathar_, Mar 21 2010
%E A168464 Keywords sign and tabl from _Michel Marcus_, Feb 01 2019