|
%I #15 Nov 02 2014 18:14:56
%S 3,5,7,8,9,11,13,14,15,17,19,20,21,23,24,25,26,27,29,31,32,33,34,37,
%T 38,41,43,44,45,47,48,49,50,51,53,54,55,56,57,59,61,63,64,65,67,68,69,
%U 71,73,74,75,76,77,80,81,84,85,86,87,90,91,92,93,94,95,97,98,99,101,103,105,109,110,111,113,114,115,116,117,118,119,120,121,122,123,124,125,127,128
%N Integers n such that n! does not divide the product of elements on row n of Pascal's triangle.
%C Integers n such that A249151(n) < n.
%C Equally: Integers n such that A249431(n) is negative.
%H Antti Karttunen, <a href="/A249433/b249433.txt">Table of n, a(n) for n = 1..2676</a>
%e See the examples at A249434.
%o (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o (define A249433 (MATCHING-POS 1 0 (COMPOSE negative? A249431)))
%Y Complement: A249434.
%Y Subsequences: A000225, A024023, A024049, etc., (after their two initial terms, i.e. A249435 without its initial zero is also a subsequence), A249424, A249436.
%Y Cf. A000142, A001142, A007318, A249151, A249431.
%K nonn
%O 1,1
%A _Antti Karttunen_, Nov 02 2014
|
