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 A263081 #14 Oct 24 2015 12:24:51 %S A263081 124340,124340,124340,124340,124340,124340,124340,124340,124340, %T A263081 124340,124340,124340,124340,124340,124340,124340,124340,124340, %U A263081 124340,124340,124340,124340,124340,124340,124340,124340,124340,124340,124340,124340,124340,124340,124340,124340,124340,124340,124340,124340,24684000,24684000,24684000,24684000,24684000,24684000,24684000 %N A263081 a(n) = largest k for which A155043(k) < A262508(n); a(n) = A262509(n) + A262909(n). %C A263081 a(n) = largest k for which A155043(k) < A155043(A262509(n)). %C A263081 If a(n) > A262509(n) then it must be a leaf (see comments in A262909 for why). Particularly, we have A045765(40722) = 124340, A045765(8191770) = 24684000. %C A263081 Terms of sequence (together with the corresponding values in A262508) give particularly clean values for the boundaries that are used for example in the C++-program which computes A262896. %H A263081 Antti Karttunen, <a href="/A263081/b263081.txt">Table of n, a(n) for n = 1..68</a> %F A263081 a(n) = A263077(A262509(n)). %F A263081 a(n) = A262509(n) + A262909(n). %o A263081 (Scheme) (define (A263081 n) (+ (A262509 n) (A262909 n))) %Y A263081 Cf. A045765, A155043, A262508, A262509, A262896, A262909, A263077, A263083. %K A263081 nonn %O A263081 1,1 %A A263081 _Antti Karttunen_, Oct 09 2015