|
%I #12 Nov 11 2019 00:26:28
%S 1,2,2,4,5,7,9,12,16,19,24,30,37,45,53,66,77,93,108,129,151,175,204,
%T 237,275,315,361,416,473,541,611,698,787,889,1000,1127,1267,1417,1586,
%U 1773,1977,2202,2445,2721,3014,3340,3689,4081,4502,4960,5459,6005,6598
%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 5 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 11 2019
|
