A249433 Integers n such that n! does not divide the product of elements on row n of Pascal's triangle.

3, 5, 7, 8, 9, 11, 13, 14, 15, 17, 19, 20, 21, 23, 24, 25, 26, 27, 29, 31, 32, 33, 34, 37, 38, 41, 43, 44, 45, 47, 48, 49, 50, 51, 53, 54, 55, 56, 57, 59, 61, 63, 64, 65, 67, 68, 69, 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

Offset

1,1

Comments

Integers n such that A249151(n) < n.

Equally: Integers n such that A249431(n) is negative.

Links

Antti Karttunen, Table of n, a(n) for n = 1..2676

Example

See the examples at A249434.

Prog

(Scheme, with Antti Karttunen's IntSeq-library)
(define A249433 (MATCHING-POS 1 0 (COMPOSE negative? A249431)))

Crossrefs

Complement: A249434.

Subsequences: A000225, A024023, A024049, etc., (after their two initial terms, i.e. A249435 without its initial zero is also a subsequence), A249424, A249436.

Cf. A000142, A001142, A007318, A249151, A249431.

Sequence in context: A196990 A060462 A072668 * A300737 A062958 A295075

Adjacent sequences: A249430 A249431 A249432 * A249434 A249435 A249436

Keyword

nonn

Author

Antti Karttunen, Nov 02 2014

Status

approved