id:A078109 - OEIS Search Results

Search: id:A078109

Displaying 1-1 of 1 results found.

page 1

Let u(1)=u(2)=1, u(3)=2n, u(k) = abs(u(k-1)-u(k-2)-u(k-3)), and M(k)= Max( u(i) : 1<=i<=k), then for any k>=a(n), M(k)=sqrtint(k + A078108(n)) where sqrtint(x) denotes floor(sqrt(x)).

+0
2

3, 10, 38, 10, 35, 66, 19, 150, 90, 30, 243, 159, 138, 270, 19, 186, 35, 178, 358, 127, 46, 334, 1, 23, 370, 438, 343, 182, 430, 46, 454, 470, 534, 30, 618, 734, 903, 570, 302, 571, 638, 30, 166, 822 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`Conjecture : a(n) always exist, a(n)/n^2 is bounded. If initial conditions are u(1)=u(2)=1, u(3)=2n+1, then u(k) reaches a 2-cycle for any k>m large enough (cf. A078098)`
	CROSSREFS	`Cf. A000196, A078108, A077623.` `Sequence in context: A005493 A123636 A092816 this_sequence A083692 A109085 A001002` `Adjacent sequences: A078106 A078107 A078108 this_sequence A078110 A078111 A078112`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Dec 05 2002`

page 1

Search completed in 0.002 seconds

Last modified September 5 19:15 EDT 2008. Contains 143484 sequences.

AT&T Labs Research