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!)
A079623 a(1)=a(2)=1, a(3)=4, a(n)=abs(a(n-1)-a(n-2)-a(n-3)). 6

%I #12 Aug 12 2020 16:40:41

%S 1,1,4,2,3,3,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,

%T 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,

%U 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

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

%H Reinhard Zumkeller, <a href="/A079623/b079623.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n*(n-10))=0; Max( a(k) : 1<=k<=n) = floor(sqrt(n+24))

%t nxt[{a_,b_,c_}]:={b,c,Abs[c-b-a]}; NestList[nxt,{1,1,4},110][[All,1]] (* _Harvey P. Dale_, Aug 12 2020 *)

%o (Haskell)

%o a079623 n = a079623_list !! (n-1)

%o a079623_list = 1 : 1 : 4 : zipWith3 (\u v w -> abs (w - v - u))

%o a079623_list (tail a079623_list) (drop 2 a079623_list)

%o -- _Reinhard Zumkeller_, Oct 11 2014

%Y Cf. A078108, A080096.

%Y Cf. A077623, A077653, A079624, A088226.

%K nonn

%O 1,3

%A _Benoit Cloitre_, Jan 30 2003

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 April 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)