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!)
A118550 a(0)=1; a(n) = a(n-1) + n if n is in the sequence, a(n) = a(n-1) + 1 if n is missing from the sequence. 0

%I #14 Mar 06 2024 04:49:26

%S 1,2,4,5,9,14,15,16,17,26,27,28,29,30,44,59,75,92,93,94,95,96,97,98,

%T 99,100,126,153,181,210,240,241,242,243,244,245,246,247,248,249,250,

%U 251,252,253,297,298,299,300,301,302,303,304,305,306,307,308,309,310,311

%N a(0)=1; a(n) = a(n-1) + n if n is in the sequence, a(n) = a(n-1) + 1 if n is missing from the sequence.

%t f[s_] := Block[{n = Length@s}, Append[s, If[ MemberQ[s, n], 2s[[ -1]], s[[ -1]] + 1]]]; Nest[f, {1}, 60] (* _Robert G. Wilson v_, May 17 2006 *)

%K easy,nonn

%O 0,2

%A _Leroy Quet_, May 03 2006

%E More terms from _Robert G. Wilson v_, May 17 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 20 00:03 EDT 2024. Contains 371798 sequences. (Running on oeis4.)