[go: up one dir, main page]

login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Revision History for A116365 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Sum of the sizes of the tails below the Durfee squares of all partitions of n.
(history; published version)
#27 by Michael De Vlieger at Wed Sep 11 10:08:31 EDT 2024
STATUS

reviewed

approved

#26 by Joerg Arndt at Wed Sep 11 02:24:51 EDT 2024
STATUS

proposed

reviewed

#25 by Michel Marcus at Wed Sep 11 02:04:46 EDT 2024
STATUS

editing

proposed

#24 by Michel Marcus at Wed Sep 11 02:04:42 EDT 2024
FORMULA

G.f.: [(d/dt){sum(q^(k^2)/product((1-q^j)(1-(tq)^j), j=1..k), k=1..inftyoo)}]_{t=1}.

STATUS

proposed

editing

#23 by Jason Yuen at Wed Sep 11 01:53:14 EDT 2024
STATUS

editing

proposed

#22 by Jason Yuen at Wed Sep 11 01:52:55 EDT 2024
COMMENTS

a(n) = Sum_{k=0..n-1} k*A114087(n,k).

FORMULA

a(n) = Sum_{k=0..n-1} k*A114087(n,k).

#21 by Jason Yuen at Wed Sep 11 01:52:15 EDT 2024
COMMENTS

a(n) = Sum(_{k=0..n-1} k*A114087(n,k), k=0..n-1).

MATHEMATICA

b[n_, i_] := b[n, i] = If[n==0, 1, If[i<1, 0, b[n, i-1] + If[i>n, 0, b[n-i, i]]]]; a[n_] := Sum[k*Sum[b[k, d]*b[n-d^2-k, d], {d, 0, Floor[Sqrt[n]]}], {k, 0, n-1}]; Table[a[n], {n, 1, 40}] (* Jean-François Alcover, Mar 31 2015, after Alois P. Heinz *) *)

STATUS

approved

editing

#20 by OEIS Server at Thu Jan 03 08:04:38 EST 2019
LINKS

Vaclav Kotesovec, <a href="/A116365/b116365_1.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Alois P. Heinz)

#19 by Vaclav Kotesovec at Thu Jan 03 08:04:38 EST 2019
STATUS

editing

approved

Discussion
Thu Jan 03
08:04
OEIS Server: Installed new b-file as b116365.txt.  Old b-file is now b116365_1.txt.
#18 by Vaclav Kotesovec at Thu Jan 03 08:04:27 EST 2019
FORMULA

a(n) ~ (1/(8*sqrt(3)) - sqrt(3) * (log(2))^2 / (4*Pi^2)) * exp(Pi*sqrt(2*n/3)). - Vaclav Kotesovec, Jan 03 2019