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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A263082 a(n) = Max( A262503(k) : k=0,1,2,3,...,n ), where A262503(k) = largest x such that A155043(x) = k. 3
 0, 2, 6, 12, 18, 22, 30, 34, 42, 48, 60, 72, 84, 96, 108, 120, 132, 140, 140, 140, 140, 140, 140, 140, 150, 156, 168, 180, 180, 184, 192, 204, 216, 228, 240, 248, 264, 280, 280, 280, 280, 288, 296, 312, 312, 320, 328, 340, 352, 364, 372, 372, 372, 372, 384, 396, 420, 420, 420, 420, 432, 450, 468, 480, 504, 520, 540, 560, 572, 580, 594, 612, 612, 618, 622, 628, 648, 672, 672, 672, 672, 672 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS From position a(n)+1 onward only terms > n will occur in A155043. LINKS Antti Karttunen, Table of n, a(n) for n = 0..10005 FORMULA a(0) = 0; for n >= 1, a(n) = max(A262503(n),a(n-1)). Other identities and observations: For all n >= 0 and for any k > a(n): A155043(k) > n. [See the comment above.] For all n >= 0: A155043(a(n)) <= n. PROG (Scheme, with memoization-macro definec) (definec (A263082 n) (if (zero? n) n (max (A262503 n) (A263082 (- n 1))))) CROSSREFS Cf. A155043, A262503, A263077, A263079. Sequence in context: A259934 A263269 A262503 * A043343 A066080 A319270 Adjacent sequences: A263079 A263080 A263081 * A263083 A263084 A263085 KEYWORD nonn AUTHOR Antti Karttunen, Oct 09 2015 STATUS approved

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

Last modified September 19 14:43 EDT 2024. Contains 376013 sequences. (Running on oeis4.)