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 A015955 #17 Mar 20 2020 19:05:40 %S A015955 1,3,9,27,57,81,171,243,513,729,1083,1539,2187,3249,4401,4617,6561, %T A015955 9747,13203,13851,19683,20577,29241,32547,39609,41553,59049,61731, %U A015955 83619,87723,97641,118179,118827,124659,177147,185193,250857,263169 %N A015955 Numbers k such that k | 8^k + 1. %H A015955 Seiichi Manyama, <a href="/A015955/b015955.txt">Table of n, a(n) for n = 1..200</a> %Y A015955 Solutions to b^k == -1 (mod k): A006521 (b=2), A015949 (b=3), A015950 (b=4), A015951 (b=5), A015953 (b=6), A015954 (b=7), this sequence (b=8), A015957 (b=9), A015958 (b=10), A015960 (b=11), A015961 (b=12), A015963 (b=13), A015965 (b=14), A015968 (b=15), A015969 (b=16). %Y A015955 Column k=8 of A333429. %K A015955 nonn %O A015955 1,2 %A A015955 _Robert G. Wilson v_