# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a130725
Showing 1-1 of 1

%I A130725 #8 Aug 24 2015 02:37:18
%S A130725 2,2,3,5,2,3,4,6,7,8,9,2,3,4,5,7,8,9,10,11,12,13,14,16,17,18,19,2,3,4,
%T A130725 5,6,8,9,10,11,12,13,14,15,16,17,18,19,20,22,23,24,25,26,27,28,29,30,
%U A130725 31,32,33,34,2,3,4,5,6,7,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25
%N A130725 Irregular array where n-th row (of {binomial(n/floor(n/2)) - floor((n+1)/2)} terms) contains the positive integers (in order) which are < the greatest term of the n-th row of Pascal's triangle and which are not among the terms of the n-th row of Pascal's triangle.
%e A130725 The 5th row of Pascal's triangle is (1,5,10,10,5,1). The positive integers which are < than the greatest term (10) of this row and which are missing from this row are (2,3,4,6,7,8,9).
%p A130725 for n from 0 to 8 do brow := [seq( binomial(n,k),k=0..n)] : for k from 1 to binomial(n,floor(n/2)) do if not k in brow then printf("%d, ",k) ; fi ; od: od: # _R. J. Mathar_, Sep 02 2007
%K A130725 nonn,tabf
%O A130725 1,1
%A A130725 _Leroy Quet_, Jul 04 2007
%E A130725 More terms from _R. J. Mathar_, Sep 02 2007

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE