OFFSET
1,1
COMMENTS
All n such that 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 shorter than the distance from the edge to the nearest zero on row n of A034931 (Pascal's triangle reduced modulo 4), the latter distance taken to be infinite if there are no zeros on that row in the latter triangle.
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..10000
EXAMPLE
Row 13 of Pascal's triangle (A007318) is: {1, 13, 78, 286, 715, 1287, 1716, 1716, 1287, 715, 286, 78, 13, 1} and the term binomial(13, 5) = 1287 = 9*11*13 occurs before any term which is a multiple of 4. Note that one such term occurs right next to it, as binomial(13, 6) = 1716 = 4*3*11*13, but 1287 < 1716, thus 13 is included.
PROG
(PARI)
A249723list(upto_n) = { my(i=0, n=0); while(i<upto_n, for(k=0, n\2, if(!(binomial(n, k)%4), break, if(!(binomial(n, k)%9), i++; write("b249723.txt", i, " ", n); break))); n++); }
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Nov 04 2014
STATUS
approved