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 A246496 #12 Aug 02 2024 04:45:10 %S A246496 2,3,11,23,47,283,719,1439,2879,34549,138197,1266767,14920303 %N A246496 Smallest k such that 8^^n is not congruent to 8^^(n-1) mod k, where 8^^n denotes the power tower 8^8^...^8 (in which 8 appears n times). %C A246496 For general remarks regarding sequences of this type, see A246491. %o A246496 (Sage, cython) Use linked source from A246491 with this command: find_k_values(8,1,1) %Y A246496 Cf. A027763, A056637, A246491 - A246497 %Y A246496 Large overlap with A056637. %K A246496 nonn,more %O A246496 1,1 %A A246496 _Wayne VanWeerthuizen_, Aug 27 2014