login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 0
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, 5, 6, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 24, 25, 26, 27, 28, 29, 30, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..81.

EXAMPLE

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).

MAPLE

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

CROSSREFS

Sequence in context: A058256 A140183 A280408 * A256015 A138117 A175908

Adjacent sequences:  A130722 A130723 A130724 * A130726 A130727 A130728

KEYWORD

nonn,tabf

AUTHOR

Leroy Quet, Jul 04 2007

EXTENSIONS

More terms from R. J. Mathar, Sep 02 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 20:44 EST 2019. Contains 329849 sequences. (Running on oeis4.)