login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A078109 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)). 1
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; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Conjecture : a(n) always exists, 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)

LINKS

Table of n, a(n) for n=1..44.

CROSSREFS

Cf. A000196, A078108, A077623.

Sequence in context: A289990 A123636 A092816 * A149045 A149046 A149047

Adjacent sequences:  A078106 A078107 A078108 * A078110 A078111 A078112

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Dec 05 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 19 12:57 EDT 2019. Contains 327198 sequences. (Running on oeis4.)