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 A246795 #13 Nov 04 2014 22:55:04 %S A246795 1,1,2,3,5,5,7,8,9,8,12,10,11,12,9,12,15,10,11,15,10,17,13,16,20,17, %T A246795 21,19,19,24,13,23,18,21,17,26,26,29,19,23,23,25,27,27,29,24,26,25,33, %U A246795 28,32,32,31,36,35,37,42,33,28,35,30,36,30,34,44,29,32,34,33,30,40,38,34,44 %N A246795 a(n) = A246793(A005669(n)). %C A246795 This sequence evaluates the largest m's defined in A246793 for the index of primes where largest gaps occurs. %C A246795 Conjecture: For every n, a(n) is positive. %C A246795 a(75) = 44 and A246794(75) = 6 hence A182134(34952141021660495 - k) = k for 5 < k < 45, where 34952141021660495 = A005669(75). %Y A246795 Cf. A000040, A002386, A005669, A182134, A246785, A246794. %K A246795 nonn,hard %O A246795 2,3 %A A246795 _Farideh Firoozbakht_, Oct 24 2014