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 A301915 #16 May 23 2018 09:51:48 %S A301915 4,6,5,16,18,28,30,42,52,29,78,41,88,48,100,53,112,126,65,136,138,148, %T A301915 162,172,89,196,198,210,222,113,232,120,125,256,268,280,282,292,316, %U A301915 330,168,173,352,378,388,400,204,209,146,221,448,228,460,462,233 %N A301915 a(n) is the multiplicative order of 3, modulo A301913(n). %C A301915 The multiplicative order of x mod y is the least positive value of z for which x^z == 1 (mod y). %C A301915 Note: This is the least value for which A301913(n) divides 3^(A301914(n) + k*A(n)) + 2 for every nonnegative integer k. %e A301915 a(1) = 4 because A301913(1) = 5 and the multiplicative order of 3 modulo 5 = 4. %e A301915 Note: Given a(1) = 4 and A301914(1) = 5, every value of k that can be written as k = 5 + 5j (for a nonnegative integer j) is a multiple of A301913(1) = 5. %e A301915 a(7) = 30 because A301913(7) = 31 and the multiplicative order of 3 modulo 31 = 4. %e A301915 Note: Given a(7) = 9 and A301914(7) = 30, every value of k that can be written as k = 30 + 9j (for a nonnegative integer j) is a multiple of A301913(7) = 31. %Y A301915 Cf. A301913, A301914. %K A301915 nonn %O A301915 1,1 %A A301915 _Luke W. Richards_, Mar 28 2018