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 A064496 #9 Jul 14 2023 16:33:00 %S A064496 7,7,11,7,11,7,7,11,7,11,7,7,11,11,7,7,11,11,7,11,7,7,11,7,11,7,7,11, %T A064496 7,11,7,7,7,7,11,7,7,11,11,7,7,11,11,7,11,7,11,7,11,11,7,7,7,7,11,7,7, %U A064496 11,11,7,7,11,11,11,11,7,7,11,11,7,11,11,7,11,7 %N A064496 a(n) is the least k such that k * A007519(n) + 1 = 0 (mod 12). %C A064496 Original name: Values of n such that 4j = np+1 where p = 8x+1, x integer, p prime and j mod 3 = 0. %H A064496 H. Mishima, <a href="http://www.asahi-net.or.jp/~KC2H-MSM/mathland/overview.htm">Overview of "Mathematician's Secret Room"</a> %e A064496 For example, A007519(1)=17, 4j=17p+1 implies k is 7 and j is 30. The values that give 7 form the basis for solutions for the Erdős-Straus conjecture: 4/n=1/a+1/b+1/c for n >= 2, a,b,c>0 and integers. %K A064496 nonn %O A064496 1,1 %A A064496 _Jon Perry_, Oct 05 2001 %E A064496 Entry revised by _Sean A. Irvine_, Jul 14 2023