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!)
A118030 a(1)=1. a(n) = a(n-1) + (largest integer which is <= n and occurs among the earlier terms of the sequence). 5

%I #10 Sep 19 2017 21:54:00

%S 1,2,4,8,12,16,20,28,36,44,52,64,76,88,100,116,132,148,164,184,204,

%T 224,244,264,284,304,324,352,380,408,436,464,492,520,548,584,620,656,

%U 692,728,764,800,836,880,924,968,1012,1056,1100,1144,1188,1240,1292,1344,1396,1448,1500,1552,1604,1656,1708,1760

%N a(1)=1. a(n) = a(n-1) + (largest integer which is <= n and occurs among the earlier terms of the sequence).

%H Michael De Vlieger, <a href="/A118030/b118030.txt">Table of n, a(n) for n = 1..5000</a>

%t a = {1}; Do[k = i + 1; While[Nand[MemberQ[a, k], k <= i + 1], k--]; AppendTo[a, a[[i]] + k], {i, 61}]; a (* _Michael De Vlieger_, Sep 19 2017 *)

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

%K easy,nonn

%O 1,2

%A _Leroy Quet_, Apr 10 2006

%E More terms from Melissa Donovan (msd181(AT)psu.edu), Apr 23 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 March 28 08:22 EDT 2024. Contains 371236 sequences. (Running on oeis4.)