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.

A245019 Number of ordered n-tuples of positive integers, whose minimum is 0 and maximum is 4.

Original entry on oeis.org

0, 2, 24, 194, 1320, 8162, 47544, 266114, 1448520, 7727522, 40616664, 211117634, 1088079720, 5571427682, 28384443384, 144041002754, 728708854920, 3677645732642, 18524892775704, 93171895169474, 468051525534120, 2349032799986402
Offset: 1

Views

Author

Ovidiu Bagdasar, Sep 17 2014

Keywords

Comments

For given k and n positive integers, let T(k,n) represent the number of n-tuples of positive integers, whose minimum is zero and maximum is k. In this notation, the sequence corresponds to a(n) = T(4,n).

Examples

			For n=2 the a(2)=2 solutions are (0,4) and (4,0).
		

Crossrefs

T(1,n) gives A000918, T(2,n-1) gives A028243, T(n,3) gives A008588, T(n,4) gives A005914.

Programs

  • PARI
    concat(0, Vec(-2*x^2/((3*x-1)*(4*x-1)*(5*x-1)) + O(x^100))) \\ Colin Barker, Sep 17 2014

Formula

a(n) = 5^n-2*4^n+3^n.
a(n) = 12*a(n-1)-47*a(n-2)+60*a(n-3). G.f.: -2*x^2 / ((3*x-1)*(4*x-1)*(5*x-1)). - Colin Barker, Sep 17 2014
a(n) = 2*A016753(n-2) for n>1. - Colin Barker, Sep 17 2014