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