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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A076874 n - floor ( ( 4*n + 1 )^(1/2) ). 3
 0, 0, 1, 1, 2, 3, 3, 4, 5, 5, 6, 7, 8, 8, 9, 10, 11, 11, 12, 13, 14, 15, 15, 16, 17, 18, 19, 19, 20, 21, 22, 23, 24, 24, 25, 26, 27, 28, 29, 29, 30, 31, 32, 33, 34, 35, 35, 36, 37, 38, 39, 40, 41, 41, 42, 43, 44, 45, 46, 47, 48, 48, 49, 50, 51, 52, 53, 54, 55, 55, 56, 57, 58, 59 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,5 COMMENTS Conjecture: For n>=7, a(n)-2 is the maximum number of steps in a 2D self-avoiding random walk trapped after n steps having only 2 choices for the next step. a(n) >= A077484(n) + 2. LINKS Table of n, a(n) for n=3..76. Hugo Pfoertner, Results for the 2D Self-Trapping Random Walk MAPLE A076874:=n->n - floor((4*n + 1)^(1/2)); seq(A076874(n), n=3..50); # Wesley Ivan Hurt, Mar 01 2014 MATHEMATICA Table[n - Floor[(4 n + 1)^(1/2)], {n, 3, 50}] (* Wesley Ivan Hurt, Mar 01 2014 *) CROSSREFS Cf. A077483, A077484, A001411. Sequence in context: A248186 A248183 A049474 * A127041 A173023 A127039 Adjacent sequences: A076871 A076872 A076873 * A076875 A076876 A076877 KEYWORD easy,nonn AUTHOR Hugo Pfoertner, Nov 24 2002 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 December 11 00:22 EST 2023. Contains 367717 sequences. (Running on oeis4.)