Revision History for A066723
(Underlined text is an addition;
strikethrough text is a deletion.)
Showing entries 1-10
| older changes
|
|
A066723
|
|
Number of distinct partitions of n-th triangular number which can be obtained by merging parts in the partition 1+2+...+n.
(history;
published version)
|
|
|
#15 by Michel Marcus at Sat Nov 04 02:48:18 EDT 2023
|
|
|
|
#14 by Stefano Spezia at Sat Nov 04 02:07:55 EDT 2023
|
|
|
|
#13 by Sean A. Irvine at Fri Nov 03 19:25:25 EDT 2023
|
|
|
|
#12 by Sean A. Irvine at Fri Nov 03 19:25:21 EDT 2023
|
| DATA
|
1, 1, 2, 5, 13, 36, 109, 340, 1116, 3744, 12981, 45722, 165247, 603242, 2242932, 8422438, 32040585, 122800802, 475937009
|
| EXTENSIONS
|
a(16)-a(18) from Sean A. Irvine, Nov 03 2023
|
| STATUS
|
approved
editing
|
|
|
|
#11 by N. J. A. Sloane at Tue Jun 24 01:08:19 EDT 2014
|
| EXTENSIONS
|
Edited by _Dean Hickerson (dean.hickerson(AT)yahoo.com), _, Jan 18 2002
|
|
|
Discussion
|
Tue Jun 24
| 01:08
| OEIS Server: https://oeis.org/edit/global/2238
|
|
|
|
#10 by Alois P. Heinz at Fri May 31 08:43:23 EDT 2013
|
|
|
|
#9 by Alois P. Heinz at Fri May 31 08:42:18 EDT 2013
|
|
|
|
#8 by Alois P. Heinz at Fri May 31 08:41:02 EDT 2013
|
| MAPLE
|
b:= proc(n) b(n):= `if`(n<2, {[1$n]}, map(x-> [sort([x[], n]),
seq(sort(subsop(i=x[i]+n, x)), i=1..nops(x))][], b(n-1)))
end:
a:= n-> nops(b(n)):
seq(a(n), n=0..10); # Alois P. Heinz, May 31 2013
|
| EXTENSIONS
|
a(15) from Alois P. Heinz, May 31 2013
|
|
|
|
#7 by Alois P. Heinz at Fri May 31 08:37:20 EDT 2013
|
| DATA
|
1, 1, 2, 5, 13, 36, 109, 340, 1116, 3744, 12981, 45722, 165247, 603242, 2242932, 8422438
|
| STATUS
|
approved
editing
|
|
|
|
#6 by Russ Cox at Sat Mar 31 13:50:43 EDT 2012
|
| AUTHOR
|
_Naohiro Nomoto (n_nomoto(AT)yabumi.com), _, Jan 15 2002
|
|
|
Discussion
|
Sat Mar 31
| 13:50
| OEIS Server: https://oeis.org/edit/global/907
|
|
|
|
|