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.
%I A027593 #9 Nov 11 2019 00:04:26 %S A027593 1,2,3,5,6,10,12,17,22,29,36,48,58,73,91,111,134,165,197,236,283,335, %T A027593 395,469,547,640,748,868,1002,1164,1335,1534,1760,2011,2288,2612,2958, %U A027593 3352,3795,4280,4816,5427,6084,6817,7636,8527,9506,10604,11786,13092,14535 %N A027593 Sequence satisfies T^2(a)=a, where T is defined below. %D A027593 S. Viswanath (student, Dept. Math, Indian Inst. Technology, Kanpur) A Note on Partition Eigensequences, preprint, Nov 15 1996. %H A027593 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 A027593 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 A027593 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. %F A027593 A027593 = T(A027594). - _Sean A. Irvine_, Nov 10 2019 %Y A027593 Cf. A007211, A027594. %K A027593 nonn,eigen %O A027593 1,2 %A A027593 _N. J. A. Sloane_, Dec 11 1999 %E A027593 Revised by _Sean A. Irvine_, Nov 10 2019