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-2 of 2 results.

A006568 Denominators of generalized Bernoulli numbers.

Original entry on oeis.org

1, 3, 18, 90, 270, 1134, 5670, 2430, 7290, 133650, 112266, 1990170, 9950850, 2296350, 984150, 117113850, 351341550, 33657930, 21597171750, 3410079750, 572893398, 33613643250, 834229509750, 108812544750, 544062723750, 18280507518, 105464466450, 18690647109750
Offset: 0

Views

Author

Keywords

Comments

Triangle A209518 * [1, -1/3, 1/18, 1/90, ...] = [1, 0, 0, 0, 0, ...]. - Gary W. Adamson, Mar 09 2012

Examples

			a(0), a(1), a(2), ... = (1, -1/3, 1/18, ...) = leftmost column of the inverse of the 3 X 3 matrix [1; 1, 3; 1, 4, 6; ...].
		

References

  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Programs

  • Mathematica
    rows = 28; M = Table[If[n-1 <= k <= n, 0, Binomial[n, k]], {n, 2, rows+1}, {k, 0, rows-1}] // Inverse;
    M[[All, 1]] // Denominator (* Jean-François Alcover, Jul 14 2018 *)
  • Sage
    def A006568_list(len):
        f, R, C = 1, [1], [1]+[0]*(len-1)
        for n in (1..len-1):
            f *= n
            for k in range(n, 0, -1):
                C[k] = C[k-1] / (k+2)
            C[0] = -sum(C[k] for k in (1..n))
            R.append((C[0]*f).denominator())
        return R
    print(A006568_list(28)) # Peter Luschny, Feb 20 2016

Formula

Given a variant of Pascal's triangle (cf. A209518) in which the two rightmost diagonals are deleted, invert the triangle and extract the leftmost column. Considered as a sequence, we obtain A006568/A006569: (1, -1/3, 1/18, 1/90, ...). - Gary W. Adamson, Mar 09 2012

Extensions

More terms from Peter Luschny, Feb 20 2016

A209518 Triangle by rows, reversal of A104712.

Original entry on oeis.org

1, 1, 3, 1, 4, 6, 1, 5, 10, 10, 1, 6, 15, 20, 15, 1, 7, 21, 35, 35, 21, 1, 8, 28, 56, 70, 56, 28, 1, 9, 36, 84, 126, 126, 84, 36, 1, 10, 45, 120, 210, 252, 210, 120, 45, 1, 11, 55, 165, 330, 462, 462, 330, 165, 55
Offset: 0

Views

Author

Gary W. Adamson, Mar 09 2012

Keywords

Comments

The offset is chosen as "0" to match the generalized or compositional Bernoulli numbers.
Following [Blandin and Diaz], we can generalize a subset of Bernoulli numbers to comply with the origin of the triangle (the Pascal matrix A007318 beheaded once: (A074909), twice: (this triangle), and so on...); and a corresponding Bernoulli sequence that equals the inverse of the triangle, extracting the left border. This procedure done with A074909 results in The Bernoulli numbers (A027641/A026642) starting (1, -1/2, 1/6,...). Done with this triangle we obtain A006568/A006569: (1, -1/3, 1/18, 1/90,...).
A generalized algebraic property of the subset of such triangles and compositional Bernoulli numbers is that the triangle M * [corresponding Bernoulli sequence considered as a vector, V] = [1, 0, 0, 0,...].
The infinite set of generalized Bernoulli number sequences thus generated from variants of Pascal's triangle begins: [(1, -1/2, 1/6,...); (1, -1/3, 1/18,...); (1, -1/4, 1/40,...); (1, -1/5, 1/75,...); where the third term denominators = A002411 (1, 6, 18, 40, 75,...) after the "1".
Row sums of the triangle = A000295 starting (1, 4, 11, 26, 57,...).

Examples

			First few rows of the triangle =
1;
1, 3;
1, 4, 6;
1, 5, 10, 10;
1, 6, 15, 20, 15;
1, 7, 21, 35, 35, 21;
1, 8, 28, 56, 70, 56, 28;
1, 9, 36, 84, 126, 126, 84, 36;
1, 10, 45, 120, 210, 252, 210, 120, 45;
1, 11, 55, 165, 330, 462, 462, 30, 165, 55;
...
		

Crossrefs

Programs

  • Mathematica
    Table[Binomial[n+2, k+2], {n, 0, 9}, {k, n , 0, -1}] // Flatten (* Jean-François Alcover, Aug 08 2018 *)

Formula

Doubly beheaded variant of Pascal's triangle in which two rightmost diagonals are deleted.
T(n,k)=T(n-1,k)+3*T(n-1,k-1)-2*T(n-2,k-1)-3*T(n-2,k-2)+T(n-3,k-2)+T(n-3,k-3), T(0,0)=1, T(n,k)=0 if k<0 or if k>n. - Philippe Deléham, Jan 11 2014
Showing 1-2 of 2 results.