This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A301483 a(n) = floor(a(n-1)/(2^(1/3)-1) with a(1)=1. 2

%I

%S 1,3,11,42,161,619,2381,9160,35241,135583,521631,2006882,7721121,

%T 29705639,114287161,439699520,1691665681,6508382763,25039844851,

%U 96336348522,370636962881,1425959779059,5486126574341,21106896023080,81205027571321,312421897357543

%N a(n) = floor(a(n-1)/(2^(1/3)-1) with a(1)=1.

%C a(n+1)/a(n) approaches 1/(2^(1/3)-1).

%F Conjectures from _Colin Barker_, Apr 01 2018: (Start)

%F G.f.: x*(1 - x - x^2) / ((1 - x)*(1 - 3*x - 3*x^2 - x^3)).

%F a(n) = 4*a(n-1) - 2*a(n-3) - a(n-4) for n>4.

%F (End)

%F a(n) = A195350(n) + A303647(n-2) - A195339(n-4) (conjectured).

%p a:=proc(n) option remember;

%p if n<1 then 0 else if n=1 then 1 else floor(a(n-1)/(2^(1/3)-1))

%p end if end if end proc:

%p seq(a(n), n=1..25);

%t RecurrenceTable[{a[1]==1, a[n]==Floor[a[n-1]/(2^(1/3)-1)]}, a, {n, 30}] (* _Vincenzo Librandi_, Apr 04 2018 *)

%o (PARI) a=vector(50); a[1]=1; for(n=2, #a, a[n]=a[n-1]\(2^(1/3)-1)); a \\ _Altug Alkan_, Mar 22 2018

%o (MAGMA) [n le 1 select 1 else Floor(Self(n-1)/(2^(1/3)-1)): n in [1..30]]; // _Vincenzo Librandi_, Apr 04 2018

%Y Cf. A024537, A195350 (also has 1/(2^(1/3)-1) ratio), A303647.

%K nonn

%O 1,2

%A _Gregory Gerard Wojnar_, Mar 22 2018

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

Last modified April 19 18:37 EDT 2019. Contains 322290 sequences. (Running on oeis4.)