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

 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!)
 A295772 a(n) = Sum_{k=0..n} binomial((n-k)*k, k). 3
 1, 1, 2, 4, 11, 41, 189, 1020, 6277, 43262, 328963, 2727076, 24425913, 234743744, 2406904525, 26202132494, 301579542517, 3656552470482, 46555182556971, 620695577790512, 8644238847922949, 125472134647552497, 1894393648378487895, 29696659293381522674 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Robert Israel, Table of n, a(n) for n = 0..508 FORMULA log(a(n)) ~ n*(log(n) - log(log(n)) + (log(log(n)) - 1)/log(n)). - Vaclav Kotesovec, Jan 10 2023 MAPLE seq(add(binomial((n-k)*k, k), k=0..n), n=0..30); # Robert Israel, Nov 27 2017 MATHEMATICA Table[Sum[Binomial[(n-k)*k, k], {k, 0, n}], {n, 0, 30}] CROSSREFS Cf. A060539, A226391, A264409. Sequence in context: A013182 A013170 A094762 * A099934 A067353 A105996 Adjacent sequences: A295769 A295770 A295771 * A295773 A295774 A295775 KEYWORD nonn,easy AUTHOR Vaclav Kotesovec, Nov 27 2017 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.

Last modified December 11 02:45 EST 2023. Contains 367717 sequences. (Running on oeis4.)