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 A001968 M2769 N1113 #21 Feb 04 2022 00:42:13
%S A001968 3,9,14,19,24,30,35,40,45,51,56,61,66,71,77,82,87,92,98,103,108,113,
%T A001968 119,124,129,134,140,145,150,155,161,166,171,176,181,187,192,197,202,
%U A001968 208,213,218,223,229,234,239,244,250,255,260,265,270,276,281,286,291
%N A001968 v-pile positions of the 4-Wythoff game with i=3.
%C A001968 See Connell (1959) for further information.
%D A001968 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A001968 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A001968 T. D. Noe, <a href="/A001968/b001968.txt">Table of n, a(n) for n = 0..10000</a>
%H A001968 Ian G. Connell, <a href="http://dx.doi.org/10.4153/CMB-1959-024-3">A generalization of Wythoff's game</a>, Canad. Math. Bull. 2 (1959) 181-190
%F A001968 a(n) = floor( (n+3/4)*(3+sqrt 5) ). - _R. J. Mathar_, Feb 14 2011
%t A001968 Table[Floor[(n + 3/4)*(Sqrt[5] + 3)], {n, 0, 100}] (* _T. D. Noe_, Aug 17 2012 *)
%Y A001968 Cf. A001967 (u-pile).
%K A001968 nonn,easy
%O A001968 0,1
%A A001968 _N. J. A. Sloane_
%E A001968 Edited by _Hugo Pfoertner_, Dec 27 2021