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.

A332706 Index position of {2}^n within the list of partitions of 2n in canonical ordering.

This page as a plain text file.
%I A332706 #20 Aug 20 2021 04:27:11
%S A332706 1,1,3,8,18,37,71,128,223,376,617,991,1563,2423,3704,5589,8333,12293,
%T A332706 17959,25996,37318,53153,75153,105535,147249,204201,281563,386128,
%U A332706 526795,715191,966437,1300125,1741598,2323487,3087701,4087933,5392747,7089463,9289053
%N A332706 Index position of {2}^n within the list of partitions of 2n in canonical ordering.
%C A332706 The canonical ordering of partitions is described in A080577.
%H A332706 Alois P. Heinz, <a href="/A332706/b332706.txt">Table of n, a(n) for n = 0..5000</a>
%F A332706 a(n) = A000041(2n) - n.
%F A332706 a(n) = A058984(2n).
%F A332706 a(n) = A330661(2n,n).
%e A332706 a(3) = 8, because 222 has position 8 within the list of partitions of 6 in canonical ordering: 6, 51, 42, 411, 33, 321, 3111, 222, ... .
%p A332706 a:= n-> combinat[numbpart](2*n)-n:
%p A332706 seq(a(n), n=0..44);
%t A332706 a[n_] := PartitionsP[2n] - n;
%t A332706 Table[a[n], {n, 0, 44}] (* _Jean-François Alcover_, Aug 20 2021, from Maple *)
%Y A332706 Bisection (even part) of A058984.
%Y A332706 Cf. A000041, A080577, A216053, A238639, A238640, A322761, A330661.
%K A332706 nonn
%O A332706 0,3
%A A332706 _Alois P. Heinz_, Feb 20 2020