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.

A276587 Transpose of square array A276586.

Original entry on oeis.org

1, 3, 2, 11, 8, 6, 55, 44, 36, 30, 375, 320, 276, 240, 210, 3731, 3356, 3036, 2760, 2520, 2310, 47743, 44012, 40656, 37620, 34860, 32340, 30030, 777771, 730028, 686016, 645360, 607740, 572880, 540540, 510510, 14770535, 13992764, 13262736, 12576720, 11931360, 11323620, 10750740, 10210200, 9699690
Offset: 0

Views

Author

Antti Karttunen, Sep 18 2016

Keywords

Comments

Rows give the successive first differences of A136104.

Examples

			The top left corner of the array:
      1,      3,       11,        55,        375,         3731
      2,      8,       44,       320,       3356,        44012
      6,     36,      276,      3036,      40656,       686016
     30,    240,     2760,     37620,     645360,     12576720
    210,   2520,    34860,    607740,   11931360,    277008480
   2310,  32340,   572880,  11323620,  265077120,   7687412040
  30030, 540540, 10750740, 253753500, 7422334920, 235239464460
		

Crossrefs

Topmost row: A136104. For other rows and columns, see the information given in transpose A276586.
Cf. also A276589.

Programs

  • PARI
    P(n)=prod(i=1, n, prime(i));
    T(n, k) = sum(j=0, n, binomial(n, j)*P(k + j));
    for(n=0, 10, for(k=0, n, print1(T(n - k, k),", ");); print();) \\ Indranil Ghosh, Apr 11 2017
  • Scheme
    (define (A276587 n) (A276586bi (A025581 n) (A002262 n))) ;; Code for A276586bi given in A276586.