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

%I #12 May 14 2023 12:37:41

%S 11,17,25,38,57,85,128,192,288,432,648,972,1458,2187,3280,4920,7380,

%T 11070,16605,24908,37362,56043,84064,126096,189144,283716,425574,

%U 638361,957542,1436313,2154469,3231704,4847556,7271334,10907001,16360501

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

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

%t a[n_]:= a[n]= 11 +Quotient[1 + Sum[a[k], {k,n-1}], 2];

%t Table[a[n], {n,60}] (* _G. C. Greubel_, May 08 2023 *)

%o (SageMath)

%o @CachedFunction

%o def A120139(n): return 11 +(1 +sum(A120139(k) for k in range(1,n)))//2

%o [A120139(n) for n in range(1,60)] # _G. C. Greubel_, May 08 2023

%Y Cf. A073941, A072493, A112088, A120134 - A120138, A120140 - A120209.

%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 19 18:00 EDT 2024. Contains 371797 sequences. (Running on oeis4.)