Maximal coefficient of Product_{k<=n} (x^k+1). Number of solutions to +- 1 +- 2 +- 3 +- ... +- n = 0 or 1.
1, 1, 1, 2, 2, 3, 5, 8, 14, 23, 40, 70, 124, 221, 397, 722, 1314, 2410, 4441, 8220
4 seqfan posts
Tue Jan 19 16:13:18 CET 2010 [seqfan] Re: New or old seq: The maximum number of shift-minimal winning coalitions, 'On Dedekind's problem for complete simple games'
Tue Jan 19 07:27:20 CET 2010 [seqfan] Re: New or old seq: The maximum number of shift-minimal winning coalitions, 'On Dedekind's problem for complete simple games'
Tue Jan 19 06:03:49 CET 2010 [seqfan] Re: New or old seq: The maximum number of shift-minimal winning coalitions, "On Dedekind's problem for complete simple games"
Tue Jan 19 04:13:49 CET 2010 [seqfan] New or old seq: The maximum number of shift-minimal winning coalitions, "On Dedekind's problem for complete simple games"
Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword
Links to OEIS content are included according to
The OEIS End-User License Agreement
.