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 A076542 #15 Apr 08 2025 18:17:52
%S A076542 1,2,86,89,90,133,5235,5236
%N A076542 Numbers n such that A068340(n) = +-1.
%C A076542 Presumably A068340(n)=0 only for n=10; so I looked for n's such that A068340(n)=+/-s; here s=1 (and n<=800000). For s=6, there's no solution at all! For s=8, n=34 (only 1 solution); for s=7, n={55, 56} (2 solutions); for s=9, n={5, 51, 52} (3 solutions) (for n up to 800000).
%C A076542 Any subsequent terms are > 10^12. - _Lucas A. Brown_, Mar 18 2024
%H A076542 Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/A076542.py">Python program</a>.
%Y A076542 Cf. A068340.
%K A076542 hard,nonn,more
%O A076542 1,2
%A A076542 _Zak Seidov_, Oct 19 2002