|
%I #12 Nov 09 2019 21:14:38
%S 1,2,2,4,5,7,9,12,16,20,25,32,39,49,58,73,86,104,122,147,173,203,236,
%T 276,321,371,426,491,562,643,729,833,941,1067,1199,1355,1521,1705,
%U 1907,2132,2381,2649,2942,3269,3622,4012,4426,4893,5390,5937,6522,7168,7864
%N Sequence satisfies T(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 parts = 0 mod 3 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
|
