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 A335693 #11 Jul 20 2020 16:24:14 %S A335693 0,1,2,14,82,593,4820,43980,444612,4934721,59661254,780531034, %T A335693 10987095718,165586966817,2660378564776,45392022568024, %U A335693 819716784789192,15620010933562689,313219935456042954,6593238655510464742,145364470356686267258,3349976056859294611697 %N A335693 A000904(n) - (-1)^n. %C A335693 A000179(n) = a(n-2) - a(n-4) for n >= 2. For example A000179(6) = 80 = 82 - 2 = a(4) - a(2). %D A335693 I. Kaplansky and J. Riordan, The problème des ménages, Scripta Math. 12, (1946), 113-124. See q_n. %H A335693 I. Kaplansky and J. Riordan, <a href="/A000166/a000166_1.pdf">The problème des ménages</a>, Scripta Math. 12, (1946), 113-124. [Scan of annotated copy] %Y A335693 Cf. A000166, A000904, A335691, A335692. %K A335693 nonn %O A335693 0,3 %A A335693 _N. J. A. Sloane_, Jul 20 2020