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.

A260338 Triangle read by rows: Cayley's numbers phi(m,n) (m,n>=0). Row m contains phi(m,0), phi(m-1,1), phi(m-2,2), ..., phi(0,m).

Original entry on oeis.org

1, 1, 1, 2, 2, 2, 5, 6, 6, 6, 17, 23, 24, 24, 24, 73, 109, 118, 120, 120, 120, 388, 618, 690, 714, 720, 720, 720, 2461, 4096, 4686, 4926, 5016, 5040, 5040, 5040, 18155, 31133, 36308, 38688, 39768, 40200, 40320, 40320, 40320
Offset: 0

Views

Author

N. J. A. Sloane, Jul 30 2015

Keywords

Examples

			Triangle begins:
1,
1,1,
2,2,2,
5,6,6,6,
17,23,24,24,24,
73,109,118,120,120,120,
388,618,690,714,720,720,720,
...
		

Crossrefs

The outer diagonals are A002135, A000142.

Programs

  • Maple
    phi:= proc(m, n) option remember;
            `if`(n+m<2, 1, `if`(n+m=2, 2, m*phi(m-1, n)-
            `if`(n=0, (m-1)*(m-2)/2*phi(m-3, 0), -n*phi(m, n-1))))
          end:
    seq(seq(phi(m-k, k), k=0..m), m=0..10);  # Alois P. Heinz, Jul 30 2015
  • Mathematica
    phi[m_, n_] := phi[m, n] = If[n+m < 2, 1, If[n+m == 2, 2, m*phi[m-1, n] - If[n == 0, (m-1)*(m-2)/2*phi[m-3, 0], -n*phi[m, n-1]]]]; Table[Table[phi[ m-k, k], {k, 0, m}], {m, 0, 10}] // Flatten (* Jean-François Alcover, Feb 17 2016, after Alois P. Heinz *)

Formula

phi(0,0)=1, phi(1,0)=phi(0,1)=1, phi(2,0)=phi(1,1)=phi(0,2)=2; for m>2, phi(m,0) = m*phi(m-1,0) - (m-1)*(m-2)/2*phi(m-3,0); for m>2, n>0, phi(m,n) = m*phi(m-1,n) + n*phi(m,n-1).

Extensions

More terms from Alois P. Heinz, Jul 30 2015