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.

Showing 1-1 of 1 results.

A168464 a(n) = A085738(n) - A085737(n).

Original entry on oeis.org

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, 43, 41, 1, 41, 22, 101, 101, 22, 41, 1, 31, 29, 106, 109, 97, 109, 106, 29, 31, 1, 31, 14, 113, 101, 101, 113, 14, 31, 1, 61, 71, 158, 161, 1271, 199, 1271, 161, 158, 71, 61, 1, 61, 38
Offset: 0

Views

Author

Paul Curtz, Nov 26 2009

Keywords

Comments

The corresponding sum is in A168140.
The sequence contains negative numbers starting in row T(15,.) of the triangle.

Examples

			As a triangle, sequence begins:
   0;
   1,  1;
   5,  2,  5;
   1,  5,  5,  1;
  31, 29, 13, 29, 31;
   1, 31, 14, 14, 31, 1;
  ...
		

Crossrefs

Programs

  • Maple
    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:
    A085737 := proc(n,k) numer(T(n,k)) ; end proc:
    A085738 := proc(n,k) denom(T(n,k)) ; end proc:
    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
  • PARI
    t(n,k) = if (k==0, (-1)^n*bernfrac(n), t(n-1, k-1) - t(n, k-1));
    T(n,k) = my(tnk=t(n,k)); denominator(tnk) - numerator(tnk);
    tabl(nn) = for (n=0, nn, for (k= 0, n, print1(T(n,k), ", ")); print); \\ Michel Marcus, Feb 01 2019

Extensions

Offset set to zero, sequence extended by R. J. Mathar, Mar 21 2010
Keywords sign and tabl from Michel Marcus, Feb 01 2019
Showing 1-1 of 1 results.