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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A338052 a(n) = A337645(n-1) - n. 3
 0, 3, 6, 5, 4, 3, 2, 1, 0, 7, 8, 7, 6, 5, 8, 7, 6, 5, 4, 3, 2, 1, 0, -1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -11, 0, -1, -2, -3, 4, 3, 2, 1, 4, 3, 2, 1, 0, -1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -11, -12, -13, -14, -15, -16, -17, -18, -19, -14, -15, -16, -17, -6, -7, -8, -9, -4, -5, -6, -7, -2, -3, -4, -5, 2, 1, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,2 COMMENTS Motivation: This is (smallest missing legal number in A336967) - n. For when we are trying to find A336957(n), the smallest legal possibility is A337645(n-1), which appears to grow like n. However, the conclusion from looking at the graph of the present sequence is that A337645(n) ~ n*(1 - 1/50) or perhaps n*(1 - c/log n) would be a better approximation to A337645. LINKS N. J. A. Sloane, Table of n, a(n) for n = 2..20001 CROSSREFS Sequence in context: A289504 A347538 A159066 * A159057 A159067 A159058 Adjacent sequences: A338049 A338050 A338051 * A338053 A338054 A338055 KEYWORD sign AUTHOR Scott R. Shannon and N. J. A. Sloane, Oct 11 2020 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 16 07:48 EDT 2024. Contains 375959 sequences. (Running on oeis4.)