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!)
A182229 a(n) = a(n-1) + floor(a(n-2)/3) with a(0)=2, a(1)=3. 4

%I #21 Sep 08 2022 08:45:55

%S 2,3,3,4,5,6,7,9,11,14,17,21,26,33,41,52,65,82,103,130,164,207,261,

%T 330,417,527,666,841,1063,1343,1697,2144,2709,3423,4326,5467,6909,

%U 8731,11034,13944,17622,22270,28144,35567,44948,56803,71785,90719,114647,144886,183101

%N a(n) = a(n-1) + floor(a(n-2)/3) with a(0)=2, a(1)=3.

%C a(n)/a(n-1) tends to (3+sqrt(21))/6 = 1.263762615825973334... [_Bruno Berselli_, Apr 23 2012]

%H Bruno Berselli, <a href="/A182229/b182229.txt">Table of n, a(n) for n = 0..1000</a>

%t RecurrenceTable[{a[0] == 2, a[1] == 3, a[n] == a[n - 1] + Floor[a[n - 2]/3]}, a, {n, 50}] (* _Bruno Berselli_, Apr 21 2012 *)

%o (Python)

%o prpr = 2

%o prev = 3

%o for i in range(2,51):

%o current = prev + prpr//3

%o print(current, end=',')

%o prpr = prev

%o prev = current

%o (Magma) [n le 2 select n+1 else Self(n-1)+Floor(Self(n-2)/3): n in [1..51]]; // _Bruno Berselli_, Apr 21 2012

%o (Haskell)

%o a182229 n = a182229_list !! n

%o a182229_list = 2 : 3 : zipWith (+)

%o (map (flip div 3) a182229_list) (tail a182229_list)

%o -- _Reinhard Zumkeller_, Apr 30 2015

%Y Cf. A064324, A182281, A182230; A176014.

%K nonn

%O 0,1

%A _Alex Ratushnyak_, Apr 19 2012

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 08:11 EDT 2024. Contains 371905 sequences. (Running on oeis4.)