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 A301914 #17 May 04 2018 22:41:44 %S A301914 1,5,2,6,16,3,9,6,23,18,43,4,60,19,79,25,68,9,28,78,32,57,158,137,75, %T A301914 111,7,22,69,86,188,65,85,176,75,64,18,239,191,286,116,140,340,338, %U A301914 257,226,65,23,51,180,30,207,201,265,131,481,94,367,58,85,79 %N A301914 a(n) is the least k for which A301913(n) divides 3^k+2. %C A301914 Combined with A301913 and A301915 can be used to eliminate values of 3^k+2 from prime searches. %H A301914 Robert Israel, <a href="/A301914/b301914.txt">Table of n, a(n) for n = 1..10000</a> %e A301914 A301913(1) = 5 and 5 divides 3^1+2 but not 3^0+2, so a(1)=1. %e A301914 A301913(5) = 19 and 19 does not divide 3^k+2 for 0 <= k < 16, however 19 divides 3^16+2, so a(5)=16. %p A301914 subs(FAIL=NULL,[seq( numtheory:-mlog(-2,3,ithprime(i)), i=3..100)]); # _Robert Israel_, May 04 2018 %Y A301914 Cf. A301913, A301915. %K A301914 nonn %O A301914 1,2 %A A301914 _Luke W. Richards_, Mar 28 2018 %E A301914 Corrected by _Robert Israel_, May 04 2018