3,5

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.

Table of n, a(n) for n=3..76.

Hugo Pfoertner, Results for the 2D Self-Trapping Random Walk

A076874:=n->n - floor((4*n + 1)^(1/2)); seq(A076874(n), n=3..50); # Wesley Ivan Hurt, Mar 01 2014

Table[n - Floor[(4 n + 1)^(1/2)], {n, 3, 50}] (* Wesley Ivan Hurt, Mar 01 2014 *)

Cf. A077483, A077484, A001411.

Sequence in context: A248186 A248183 A049474 * A127041 A173023 A127039

Adjacent sequences: A076871 A076872 A076873 * A076875 A076876 A076877

easy,nonn

Hugo Pfoertner, Nov 24 2002

approved