%I #12 Nov 09 2019 21:14:08
%S 1,2,3,3,5,6,8,11,13,17,20,25,30,37,45,52,64,73,86,102,116,137,157,
%T 180,207,236,269,305,347,389,440,494,552,621,691,771,858,951,1054,
%U 1168,1290,1422,1570,1722,1893,2079,2274,2494,2724,2974,3244,3533,3845,4181
%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]
%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