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 A003562 #10 Oct 22 2023 16:35:10 %S A003562 1,6,9,5,3,2,3,7,10,30,33,18,39,16,12,6,51,54,11,55,63,18,23,14,75,78, %T A003562 27,78,10,30,80,48,99,40,105,3,111,114,23,10,36,110,4,26,135,138,141, %U A003562 136,58,6,51,26,35,60,165,28,49,58,35,171,183,186,63,10,176 %N A003562 Least number m such that 6^m == +- 1 (mod 6n + 1). %K A003562 nonn %O A003562 1,2 %A A003562 _N. J. A. Sloane_