A076874 - OEIS

This site is supported by donations to The OEIS Foundation.

A076874

n - floor ( ( 4*n + 1 )^(1/2) ).

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; 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	`Hugo Pfoertner, Results for the 2D Self-Trapping Random Walk`
	CROSSREFS	`Cf. A077483, A077484, A001411.` `Sequence in context: A136746 A003003 A049474 * A127041 A173023 A127039` `Adjacent sequences: A076871 A076872 A076873 * A076875 A076876 A076877`
	KEYWORD	`easy,nonn`
	AUTHOR	`Hugo Pfoertner (hugo(AT)pfoertner.org), Nov 24 2002`

Content is available under The OEIS End-User License Agreement .

Last modified February 10 11:48 EST 2012. Contains 205223 sequences.