The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A263081 a(n) = largest k for which A155043(k) < A262508(n); a(n) = A262509(n) + A262909(n). 5
 124340, 124340, 124340, 124340, 124340, 124340, 124340, 124340, 124340, 124340, 124340, 124340, 124340, 124340, 124340, 124340, 124340, 124340, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(n) = largest k for which A155043(k) < A155043(A262509(n)). 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. 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. LINKS Antti Karttunen, Table of n, a(n) for n = 1..68 FORMULA a(n) = A263077(A262509(n)). a(n) = A262509(n) + A262909(n). PROG (Scheme) (define (A263081 n) (+ (A262509 n) (A262909 n))) CROSSREFS Cf. A045765, A155043, A262508, A262509, A262896, A262909, A263077, A263083. Sequence in context: A205366 A185992 A061734 * A030639 A261439 A182658 Adjacent sequences: A263078 A263079 A263080 * A263082 A263083 A263084 KEYWORD nonn AUTHOR Antti Karttunen, Oct 09 2015 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 24 22:14 EDT 2023. Contains 365582 sequences. (Running on oeis4.)