cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A323111 Number of compositions of 2n where the difference between largest and smallest parts equals n.

This page as a plain text file.
%I A323111 #14 Nov 03 2020 03:17:16
%S A323111 0,2,3,12,23,61,135,306,679,1499,3257,7053,15167,32443,69080,146533,
%T A323111 309743,652762,1371897,2876284,6017100,12562511,26180328,54469099,
%U A323111 113151406,234723068,486276265,1006195365,2079647131,4293758081,8856361762,18250277543
%N A323111 Number of compositions of 2n where the difference between largest and smallest parts equals n.
%H A323111 Alois P. Heinz, <a href="/A323111/b323111.txt">Table of n, a(n) for n = 1..200</a>
%F A323111 a(n) = A214258(2n,n).
%F A323111 Conjecture: a(n) ~ n * 2^(n-3). - _Vaclav Kotesovec_, Jan 07 2019
%e A323111 a(2) = 2: 13, 31.
%e A323111 a(3) = 3: 114, 141, 411.
%e A323111 a(4) = 12: 1115, 1151, 1511, 5111, 125, 152, 215, 251, 512, 521, 26, 62.
%e A323111 a(5) = 23: 11116, 11161, 11611, 16111, 61111, 1126, 1162, 1216, 1261, 1612, 1621, 2116, 2161, 2611, 6112, 6121, 6211, 136, 163, 316, 361, 613, 631.
%Y A323111 Cf. A117989 (the same for partitions), A214258.
%K A323111 nonn
%O A323111 1,2
%A A323111 _Alois P. Heinz_, Jan 04 2019