Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A289078

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

Showing entries 1-10 | older changes
Number of orderless same-trees of weight n.
(history; published version)
#12 by Alois P. Heinz at Mon Aug 20 20:51:15 EDT 2018
STATUS

proposed

approved

#11 by Andrew Howroyd at Mon Aug 20 20:47:10 EDT 2018
STATUS

editing

proposed

#10 by Andrew Howroyd at Mon Aug 20 20:45:20 EDT 2018
PROG

(PARI) seq(n)={my(v=vector(n)); for(n=1, n, v[n] = 1 + sumdiv(n, d, binomial(v[n/d]+d-1, d))); v} \\ Andrew Howroyd, Aug 20 2018

STATUS

approved

editing

#9 by Alois P. Heinz at Sun Aug 27 15:22:49 EDT 2017
STATUS

editing

approved

#8 by Alois P. Heinz at Sun Aug 27 15:22:44 EDT 2017
LINKS

Alois P. Heinz, <a href="/A289078/b289078.txt">Table of n, a(n) for n = 1..2500</a>

STATUS

approved

editing

#7 by Alois P. Heinz at Wed Jul 05 09:06:54 EDT 2017
STATUS

editing

approved

#6 by Alois P. Heinz at Wed Jul 05 09:06:34 EDT 2017
MAPLE

with(numtheory):

a:= proc(n) option remember; 1 + add(

binomial(a(n/d)+d-1, d), d=divisors(n) minus {1})

end:

seq(a(n), n=1..60); # Alois P. Heinz, Jul 05 2017

STATUS

proposed

editing

#5 by Gus Wiseman at Fri Jun 23 13:35:21 EDT 2017
STATUS

editing

proposed

#4 by Gus Wiseman at Fri Jun 23 13:34:30 EDT 2017
FORMULA

a(n) = 1 + Sum_{d|n, d>1} Cbinomial(a(n/d)+d-1, d).

#3 by Gus Wiseman at Fri Jun 23 13:30:44 EDT 2017