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.

A167633 Number of ordered n-tuples of positive integers such that the largest value is n and the first value is odd.

Original entry on oeis.org

1, 1, 14, 74, 1363, 13953, 330628, 5094436, 148124741, 3062897555, 105624547606, 2746180200462, 109589993167831, 3435877666633237, 155759360424218888, 5720220913807900808, 290376774291325403401, 12228041680671237910119, 687155830301443577149594
Offset: 1

Views

Author

Alois P. Heinz, Nov 07 2009

Keywords

Examples

			a(3) = 14, because there are 14 ordered 3-tuples of positive integers such that the largest value is 3 and the first value is odd: 113, 123, 131, 132, 133, 311, 312, 313, 321, 322, 323, 331, 332, 333.
		

Crossrefs

Diagonal of A123685. Cf. A047969.

Programs

  • Maple
    a:= n-> (Matrix (`if` (irem(n, 2)=0, [n/2, 0], [1 +(n-1)/2*3, 1])). Matrix ([[2*n-1, 1], [n*(1-n), 0]]) ^(n-1))[1, 2]: seq (a(n), n=1..20);

Formula

a(n) = [x^(n-1)] z/((n*x-1)*((n-1)*x-1)), where z = (n/2*x) if n is even, and z = (1-(n-1)/2*x) else.