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

A193596 Triangle given by p(n,k) = ceiling(C(n,k)/2).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 3, 2, 1, 1, 3, 5, 5, 3, 1, 1, 3, 8, 10, 8, 3, 1, 1, 4, 11, 18, 18, 11, 4, 1, 1, 4, 14, 28, 35, 28, 14, 4, 1, 1, 5, 18, 42, 63, 63, 42, 18, 5, 1, 1, 5, 23, 60, 105, 126, 105, 60, 23, 5, 1
Offset: 0

Views

Author

Clark Kimberling, Jul 31 2011

Keywords

Comments

p(n,k) = (A007318(n,k) + A047999(n,k))/2. - Jeremy Gardiner, Jul 28 2013.

Examples

			First 5 rows of A193596:
1
1....1
1....1....1
1....2....2....1
1....2....3....2....1
		

Crossrefs

Cf. A193597.
Cf. A007318.

Programs

  • Haskell
    a193596 n k = a193596_tabl !! n !! k
    a193596_row n = a193596_tabl !! n
    a193596_tabl = map (map ((flip div 2) . (+ 1))) a007318_tabl
    -- Reinhard Zumkeller, Jan 31 2015
  • Mathematica
    (See A193597, the augmentation of A193596.)

Formula

p(n,k)=ceiling((1/2)C(n,k)).
Showing 1-1 of 1 results.