A263081 a(n) = largest k for which A155043(k) < A262508(n); a(n) = A262509(n) + A262909(n).

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

Offset: 1

Author

Antti Karttunen, Oct 09 2015

Keywords

• nonn

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

Crossrefs

Cf. A045765, A155043, A262508, A262509, A262896, A262909, A263077, A263083.

Programs

Scheme

(define (A263081 n) (+ (A262509 n) (A262909 n)))

Formula

a(n) = A263077(A262509(n)).

a(n) = A262509(n) + A262909(n).