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 A153094 #7 Jun 02 2025 01:15:57 %S A153094 1,1,1,1,1,1,1,1,1,1,4,1,2,1,1,1,4,1,1,1,3,5,2,1,1,3,2,2,2,9,6,1,6,4, %T A153094 1,1,4,1,2,2,3,6,6,5,1,5,5,1,2,1,10,3,5,1,3,2,1,4,5,2,2,3,1,1,2,3,5,5, %U A153094 6,1,12,3,5,6,1,2,9,3,4,1,1,5,2,3,4,7,2,2,16,8,5,1,5,5,6,3,2,11,2,2 %N A153094 Least k(n) such that k(n)*m^n*(m^n-1)+j is prime with j= -1 or 1 or both and 1<m<10. %C A153094 when n increases sum k(n) for i=1 to n / sum n for i=1 to n tends to 0.05, 0<k(n)<0.5*n %H A153094 Pierre CAMI, <a href="/A153094/b153094.txt">Table of n, a(n) for n = 1..1000</a> %e A153094 1*2^1*(2^1-1)+1=3 prime so k(1)=1 %Y A153094 A152414, A152090, A152091, A152092, A152093, A152095 %K A153094 nonn %O A153094 1,11 %A A153094 _Pierre CAMI_, Dec 18 2008