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!)
A120201 a(1)=8; a(n)=floor((71+sum(a(1) to a(n-1)))/8). 1

%I #6 May 04 2017 08:51:09

%S 8,9,11,12,13,15,17,19,21,24,27,30,34,38,43,49,55,62,69,78,88,99,111,

%T 125,141,158,178,200,225,253,285,321,361,406,457,514,578,650,731,823,

%U 926,1041,1172,1318,1483,1668,1877,2111,2375,2672,3006,3382,3805,4280

%N a(1)=8; a(n)=floor((71+sum(a(1) to a(n-1)))/8).

%H Harvey P. Dale, <a href="/A120201/b120201.txt">Table of n, a(n) for n = 1..1000</a>

%t nxt[{s_,a_}]:=Module[{c=Floor[(s+71)/8]},{s+c,c}]; NestList[nxt,{8,8},50][[All,2]] (* _Harvey P. Dale_, May 04 2017 *)

%Y Cf. A073941, A112088, A072493.

%K nonn

%O 1,1

%A _Graeme McRae_, Jun 10 2006

%E More terms from _Harvey P. Dale_, May 04 2017

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 May 2 11:52 EDT 2024. Contains 372196 sequences. (Running on oeis4.)