login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A048000 Number of nonempty subsets of {1,2,...,n} in which exactly 4/5 of the elements are <= n/3. 1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 9, 10, 50, 55, 60, 180, 195, 210, 490, 525, 560, 1240, 1326, 1413, 3645, 3933, 4230, 12750, 13860, 15015, 45375, 49335, 53460, 150524, 163175, 176345, 470665, 509067, 549094, 1461278, 1580761 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,12
LINKS
FORMULA
a(n) = Sum_{k=1..floor(n/5)} binomial(floor(n/3), 4*k)*binomial(ceiling(2*n/3), k). - Robert Israel, Feb 05 2017
MAPLE
f:= proc(n) local k;
add(binomial(floor(n/3), 4*k/5)*binomial(n-floor(n/3), k/5), k=5..n, 5)
end proc:
map(f, [$1..60]); # Robert Israel, Feb 05 2017
PROG
(PARI) a(n)=sum(k=1, n\5, binomial(n\3, 4*k)*binomial(ceil(2*n/3), k)) \\ Charles R Greathouse IV, Feb 05 2017
CROSSREFS
Sequence in context: A270039 A048020 A363760 * A048081 A109936 A114460
KEYWORD
nonn
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 8 23:37 EST 2023. Contains 367681 sequences. (Running on oeis4.)