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 A020998 #13 Jan 05 2025 19:51:34 %S A020998 1,7,165,227,278,322,323,385,414,433,439,634,860,964,1045,1268 %N A020998 Numbers n such that the sum of the digits of Lucas(n) in base 12 is n. %H A020998 David Terr, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/34-4/terr.pdf">On the Sums of Digits of Fibonacci Numbers,</a> Fibonacci Quarterly 34, Aug. 1996, pp. 349-355. %o A020998 (PARI) isok(n) = vecsum(digits(fibonacci(n+1)+fibonacci(n-1), 12)) == n; \\ _Michel Marcus_, Feb 18 2015 %Y A020998 Cf. A020996. %K A020998 nonn,base %O A020998 1,2 %A A020998 _Sven Simon_