A174374 Derivative Pascal's triangle (version 2) read by rows: smallest prime(n)>C(m,k)=binomial(m,k)=m!/(k!*(m-k)!), 0<=k<=m.

1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 3, 4, 3, 1, 1, 4, 5, 5, 4, 1, 1, 4, 7, 9, 7, 4, 1, 1, 5, 9, 12, 12, 9, 5, 1, 1, 5, 10, 17, 20, 17, 10, 5, 1, 1, 5, 12, 24, 31, 31, 24, 12, 5, 1, 1, 5, 15, 31, 47, 55, 47, 31, 15, 5, 1, 1, 6, 17, 39, 67, 90, 90, 67, 39, 17, 6, 1, 1, 6, 19, 48, 95, 139, 158, 139

Offset

1,5

Links

Table of n, a(n) for n=1..86.

Example

Triangle begins:
1
1, 1
1, 2, 1
1, 3, 3, 1
1, 3, 4, 3, 1
1, 4, 5, 5, 4, 1
1, 4, 7, 9, 7, 4, 1
1, 5, 9, 12, 12, 9, 5, 1
1, 5, 10, 17, 20, 17, 10, 5, 1
1, 5, 12, 24, 31, 31, 24, 12, 5, 1
1, 5, 15, 31, 47, 55, 47, 31, 15, 5, 1
1, 6, 17, 39, 67, 90, 90, 67, 39, 17, 6, 1

Prog

(PARI) t(n, k) = primepi(nextprime(binomial(n, k)+1)) \\ Michel Marcus, Apr 13 2013

Crossrefs

Cf. A007318.

Sequence in context: A351522 A157458 A174447 * A242641 A347187 A027948

Adjacent sequences: A174371 A174372 A174373 * A174375 A174376 A174377

Keyword

nonn,tabl

Author

Juri-Stepan Gerasimov, Mar 20 2010

Status

approved