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.

A249726 Numbers n such that there is a multiple of 36 on row n of Pascal's triangle with property that it is also the least multiple of 4 and the least multiple of 9 on the same row.

This page as a plain text file.
%I A249726 #13 Nov 05 2014 11:29:16
%S A249726 36,72,73,108,110,144,145,147,180,216,217,218,221,252,288,289,291,295,
%T A249726 324,326,360,361,396,432,433,434,435,437,443,468,504,505,540,542,576,
%U A249726 577,579,583,612,648,649,650,653,684,720,721,723,756,758,792,793,828,864,865,866,867,869,871,875,887,900,936,937,972,974,1008,1009,1011,1044,1080
%N A249726 Numbers n such that there is a multiple of 36 on row n of Pascal's triangle with property that it is also the least multiple of 4 and the least multiple of 9 on the same row.
%C A249726 All n such that both on row n of A034931 (Pascal's triangle reduced modulo 4) and on row n of A095143 (Pascal's triangle reduced modulo 9) there is at least one zero and the distance from the edge to the nearest zero is same on both rows.
%H A249726 Antti Karttunen, <a href="/A249726/b249726.txt">Table of n, a(n) for n = 1..10000</a>
%o A249726 (PARI)
%o A249726 A249726list(upto_n) = { my(i=0, n=0); while(i<upto_n,for(k=0,n\2,if(!(binomial(n,k)%36), i++;write("b249726.txt",i," ",n);break, if((!(binomial(n,k)%4) || !(binomial(n,k)%9)), break))); n++); }
%Y A249726 Subsequence of A249724.
%Y A249726 A044102 is a subsequence (after zero).
%Y A249726 Natural numbers (A000027) is a disjoint union of the sequences A048278, A249722, A249723 and A249726.
%Y A249726 Cf. A007318, A034931, A095143, A048645, A051382.
%K A249726 nonn
%O A249726 1,1
%A A249726 _Antti Karttunen_, Nov 04 2014