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!)
A118026 a(0) = 0, a(n) = a(n-1) + (largest integer which is <= n and is missing from the earlier terms of the sequence). 5

%I #12 Sep 16 2017 20:15:03

%S 0,1,3,5,9,13,19,26,34,42,52,63,75,87,101,116,132,149,167,185,205,226,

%T 248,271,295,320,345,372,400,429,459,490,522,555,588,623,659,696,734,

%U 773,813,854,895,938,982,1027,1073,1120,1168,1217,1267,1318,1369,1422

%N a(0) = 0, a(n) = a(n-1) + (largest integer which is <= n and is missing from the earlier terms of the sequence).

%H Michael De Vlieger, <a href="/A118026/b118026.txt">Table of n, a(n) for n = 0..10000</a>

%t a = {1}; Do[AppendTo[a, a[[i - 1]] + SelectFirst[Reverse@ Range[i], FreeQ[a, #] &]], {i, 2, 53}]; {0}~Join~a (* _Michael De Vlieger_, Sep 16 2017 *)

%Y Cf. A118027, A118028, A118029, A118030, A094589.

%K easy,nonn

%O 0,3

%A _Leroy Quet_, Apr 10 2006

%E More terms from Sheedeh Dorri (spd145(AT)psu.edu) and Melissa Donovan (msd181(AT)psu.edu), Apr 18 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 May 3 11:14 EDT 2024. Contains 372207 sequences. (Running on oeis4.)