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 A035406 #12 Sep 03 2025 23:12:25 %S A035406 5,10,46,58,63,70,86,89,273,287,296,299,354,361,376,397,400,404,412, %T A035406 485,490,501,1213,1227,1236,1239,1310,1312,1337,1344,1352,1383,1388, %U A035406 1561,1564,1573,1588,1600,1621,1624,1628,1636,1736,1741,1772,1777,1790,1834 %N A035406 Limit of the position of the n-th partition into parts 5k+2 or 5k+3 in the list of all integer partitions sorted in reverse lexicographic order, for integers == 1 (mod 5). %D A035406 G. E. Andrews, The Theory of Partitions, Addison-Wesley, 1976, p. 109. %H A035406 Sean A. Irvine, <a href="/A035406/b035406.txt">Table of n, a(n) for n = 1..1000</a> %H A035406 Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a035/A035406.java">Java program</a> (github) %Y A035406 Cf. A003106, A035407, A035408, A035409, A035410. %K A035406 nonn,changed %O A035406 1,1 %A A035406 _Olivier Gérard_ %E A035406 Revised by _Geoffrey Caveney_ and _Sean A. Irvine_, Sep 03 2025