A027584 - OEIS

%I #12 Nov 09 2019 20:01:16

%S 1,2,3,4,5,8,9,12,15,19,22,28,33,39,46,54,62,72,83,94,108,121,138,154,

%T 173,193,217,239,267,295,326,359,397,435,477,525,572,625,684,745,809,

%U 883,956,1038,1126,1218,1316,1424,1536,1655,1785,1920,2065,2220,2382

%N Sequence satisfies T^2(a)=a, where T is defined below.

%D S. Viswanath (student, Dept. Math, Indian Inst. Technology, Kanpur) A Note on Partition Eigensequences, preprint, Nov 15 1996.

%H M. Bernstein and N. J. A. Sloane, <a href="http://arXiv.org/abs/math.CO/0205301">Some canonical sequences of integers</a>, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to arXiv version]

%H M. Bernstein and N. J. A. Sloane, <a href="/A003633/a003633_1.pdf">Some canonical sequences of integers</a>, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to Lin. Alg. Applic. version together with omitted figures]

%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a027/A027584.java">Java program</a> (github)

%F Define T:a->b by: given a1<=a2<=..., let b(n) = number of ways of partitioning n into parts from a1, a2, ... such that even parts do not occur more than once.

%K nonn,eigen

%O 0,2

%A _N. J. A. Sloane_.

%E More terms from _Sean A. Irvine_, Nov 09 2019