A077623 a(1)=1, a(2)=2, a(3)=4, a(n) = abs(a(n-1)-a(n-2)-a(n-3)).

1, 2, 4, 1, 5, 0, 6, 1, 5, 2, 4, 3, 3, 4, 2, 5, 1, 6, 0, 7, 1, 6, 2, 5, 3, 4, 4, 3, 5, 2, 6, 1, 7, 0, 8, 1, 7, 2, 6, 3, 5, 4, 4, 5, 3, 6, 2, 7, 1, 8, 0, 9, 1, 8, 2, 7, 3, 6, 4, 5, 5, 4, 6, 3, 7, 2, 8, 1, 9, 0, 10, 1, 9, 2, 8, 3, 7, 4, 6, 5, 5, 6, 4, 7, 3, 8, 2, 9, 1, 10, 0, 11, 1, 10, 2, 9, 3, 8, 4, 7, 5, 6, 6

Offset

1,2

Links

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Formula

a(n)/sqrt(n) is bounded. More precisely, let M(n) = Max ( a(k) : 1<=k<=n ); then M(n)= floor(sqrt(n+29)) for n>=4

Prog

(Haskell)
a077623 n = a077623_list !! (n-1)
a077623_list = 1 : 2 : 4 : zipWith3 (\u v w -> abs (w - v - u))
               a077623_list (tail a077623_list) (drop 2 a077623_list)
-- Reinhard Zumkeller, Oct 11 2014

Crossrefs

Cf. A077653, A079623, A079624, A080096, A088226.

Sequence in context: A221290 A078739 A004597 * A132042 A303977 A060370

Adjacent sequences: A077620 A077621 A077622 * A077624 A077625 A077626

Keyword

nonn

Author

Benoit Cloitre, Dec 02 2002

Status

approved