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!)
A303647 a(n) = ceiling(a(n-1)/(2^(1/3)-1)+1), a(1)=1. 2

%I #19 Jun 24 2018 11:45:48

%S 1,5,21,82,317,1221,4699,18080,69561,267625,1029641,3961362,15240637,

%T 58635641,225590199,867918160,3339160721,12846826845,49425880861,

%U 190157283842,731596320957,2814686695261,10829006332499,41662675404240,160289731905481,616686228261665

%N a(n) = ceiling(a(n-1)/(2^(1/3)-1)+1), a(1)=1.

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

%F Conjectures from _Colin Barker_, Apr 28 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)

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

%p if n<1 then 0 else

%p if n=1 then 1 else ceil(a(n-1)/(2^(1/3)-1)+1)

%p end if end if end proc;

%p seq(a(n), n=0..10);

%t Nest[Append[#, Ceiling[#[[-1]]/(2^(1/3) - 1) + 1]] &, {1}, 25] (* or *)

%t Rest@ CoefficientList[Series[x (1 + x + x^2)/((1 - x) (1 - 3 x - 3 x^2 - x^3)), {x, 0, 25}], x] (* _Michael De Vlieger_, Apr 28 2018 *)

%o (PARI) a(n) = if (n==1, 1, ceil(a(n-1)/(2^(1/3)-1)+1)); \\ _Michel Marcus_, Apr 28 2018

%Y Cf. A195350, A301483, A195339.

%K nonn

%O 1,2

%A _Gregory Gerard Wojnar_, Apr 27 2018

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 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)