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!)
A120153 a(n) = 7 + floor((2 + Sum_{j=1..n-1} a(j))/3). 1

%I #10 Jun 16 2023 11:37:24

%S 7,10,13,17,23,31,41,55,73,97,130,173,231,308,410,547,729,972,1296,

%T 1728,2304,3072,4096,5462,7282,9710,12946,17262,23016,30688,40917,

%U 54556,72741,96988,129318,172424,229898,306531,408708,544944

%N a(n) = 7 + floor((2 + Sum_{j=1..n-1} a(j))/3).

%H G. C. Greubel, <a href="/A120153/b120153.txt">Table of n, a(n) for n = 1..1000</a>

%t nxt[{t_,a_}]:=Module[{c=Floor[(23+t)/3]},{t+c,c}]; Rest[Transpose[ NestList[ nxt,{0,7},40]][[2]]] (* _Harvey P. Dale_, Oct 08 2015 *)

%o (Magma)

%o function f(n,a,b)

%o t:=0;

%o for k in [1..n-1] do

%o t+:= a+Floor((b+t)/3);

%o end for;

%o return t;

%o end function;

%o g:= func< n,a,b | f(n+1,a,b)-f(n,a,b) >;

%o A120153:= func< n | g(n,7,2) >;

%o [A120153(n): n in [1..60]]; // _G. C. Greubel_, Jun 15 2023

%o (SageMath)

%o @CachedFunction

%o def A120153(n): return 7 + (2 + sum(A120153(k) for k in range(1,n)))//3

%o [A120153(n) for n in range(1,61)] # _G. C. Greubel_, Jun 15 2023

%Y Cf. A072493, A073941, A112088.

%K nonn

%O 1,1

%A _Graeme McRae_, Jun 10 2006

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