Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
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!)
A173497 a(n) = a(n-1) + a(n-2) - floor(a(n-2)/2), starting 2,1. 3

%I #18 Aug 30 2020 22:15:41

%S 2,1,2,3,4,6,8,11,15,21,29,40,55,75,103,141,193,264,361,493,674,921,

%T 1258,1719,2348,3208,4382,5986,8177,11170,15259,20844,28474,38896,

%U 53133,72581,99148,135439,185013,252733,345240,471607,644227,880031

%N a(n) = a(n-1) + a(n-2) - floor(a(n-2)/2), starting 2,1.

%C The limiting ratio is a(n+1)/a(n): 1.36602540378443.

%C This limiting ratio is (1+sqrt(3))/2. - _Robert Israel_, Aug 30 2020

%H Robert Israel, <a href="/A173497/b173497.txt">Table of n, a(n) for n = 0..7374</a>

%F a(n) = a(n-1) + a(n-2) - floor(a(n-2)/2).

%p A[0]:= 2: A[1]:= 1:

%p for n from 2 to 100 do

%p A[n]:= A[n-1]+A[n-2]-floor(A[n-2]/2)

%p od:

%p seq(A[i],i=0..100); # _Robert Israel_, Aug 30 2020

%t l[0] = 2; l[1] = 1;

%t l[n_] := l[n] = l[n - 1] + l[n - 2] - Floor[l[n - 2]/2]

%t Table[l[n], {n, 0, 30}]

%t RecurrenceTable[{a[0]==2,a[1]==1,a[n]==a[n-1]+a[n-2]-Floor[a[n-2]/2]},a,{n,50}] (* _Harvey P. Dale_, Apr 26 2016 *)

%Y Cf. A064323, A000032.

%K nonn

%O 0,1

%A _Roger L. Bagula_, Nov 23 2010

%E More terms from _Max Alekseyev_, Jun 18 2011

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 September 11 17:54 EDT 2024. Contains 375839 sequences. (Running on oeis4.)