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.

A261365 Prime-numbered rows of Pascal's triangle.

This page as a plain text file.
%I A261365 #21 Aug 28 2015 17:31:15
%S A261365 1,2,1,1,3,3,1,1,5,10,10,5,1,1,7,21,35,35,21,7,1,1,11,55,165,330,462,
%T A261365 462,330,165,55,11,1,1,13,78,286,715,1287,1716,1716,1287,715,286,78,
%U A261365 13,1,1,17,136,680,2380,6188,12376,19448,24310,24310,19448,12376,6188,2380,680,136,17,1,1,19,171,969,3876,11628,27132,50388,75582,92378,92378,75582,50388,27132,11628,3876,969,171,19,1
%N A261365 Prime-numbered rows of Pascal's triangle.
%H A261365 Maghraoui Abdelkader, <a href="/A261365/b261365.txt">Table of n, a(n) for n = 1..4273</a>
%F A261365 T(n,k) = binomial(prime(n), k).
%e A261365 1,2,1;
%e A261365 1,3,3,1;
%e A261365 1,5,10,10,5,1;
%e A261365 1,7,21,35,35,21,7,1;
%e A261365 1,11,55,165,330,462,462,330,165,55,11,1;
%t A261365 Table[Binomial[Prime@ n, k], {n, 8}, {k, 0, Prime@ n}] // Flatten (* _Michael De Vlieger_, Aug 20 2015 *)
%o A261365 (PARI) forprime(n=2, 20, for(k=0,n,print1(binomial(n,k),", ")))
%Y A261365 Cf. A007318, A034870, A034871.
%Y A261365 Cf. A000040 (2nd column), A008837 (3rd column).
%K A261365 nonn,tabf,less
%O A261365 1,2
%A A261365 _Maghraoui Abdelkader_, Aug 16 2015