id:A078108 - OEIS Search Results

Search: id:A078108

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>=A078109(n), M(k)=sqrtint(k + a(n)) where sqrtint(x) denotes floor(sqrt(x)).

+0
4

4, 24, 156, 184, 324, 608, 940, 1784, 1844, 3104, 5996, 4600, 4484, 6128, 6220, 7208, 8244, 9, 424, 11740, 13560, 14836, 19264, 19756, 23344, 24524, 26224, 32940, 34912, 34548, 42808, 52428, 46120, 47492, 52280, 67908, 86120, 8008, 4, 147152 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`It appears that (1) a(n) always exist (2) a(n) is even (3) a(n)/n^(5/2) -> infinity. 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) - Benoit Cloitre, Jan 29 2006`
	CROSSREFS	`Cf. A000196, A078109, A077623.` `Sequence in context: A045738 A003288 A091166 this_sequence A117337 A084130 A059304` `Adjacent sequences: A078105 A078106 A078107 this_sequence A078109 A078110 A078111`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Dec 05 2002`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research