login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A078589 a(1)=0, a(2)=1, a(n) = abs(abs(a(n-1)) - a(n-2) - n + 1). 1

%I #17 Oct 26 2022 03:04:36

%S 0,1,1,3,2,6,2,11,1,19,8,22,2,33,17,31,2,46,26,39,7,53,24,52,4,73,43,

%T 57,14,72,28,75,15,93,44,84,4,117,75,81,34,88,12,119,63,101,8,140,84,

%U 105,29,127,46,134,34,155,65,147,24,182,98,145,15,193,114,144,36,175

%N a(1)=0, a(2)=1, a(n) = abs(abs(a(n-1)) - a(n-2) - n + 1).

%C It seems that lim_{n -> oo} M(n)/n = 3.4... where M(n) = Max(a(k), 1<=k<=n). Does a(n)=1 for a finite number of values? The first ones are 2, 3, 9, 177, 3891, ...

%H John Tyler Rascoe, <a href="/A078589/b078589.txt">Table of n, a(n) for n = 1..10000</a>

%o (Python)

%o def A078589_list(max_n):

%o A = [0,1]

%o for n in range(3,max_n + 1):

%o A.append(abs(A[-1] - A[-2] - n + 1))

%o return(A) # _John Tyler Rascoe_, Oct 25 2022

%K nonn

%O 1,4

%A _Benoit Cloitre_, Dec 06 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 13 07:44 EDT 2024. Contains 375113 sequences. (Running on oeis4.)