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!)
A022936 a(n) = a(n-1) + c(n-1) for n >= 2, a( ) increasing, given a(1)=4; where c( ) is complement of a( ). 2

%I #8 Apr 04 2016 18:54:33

%S 4,5,7,10,16,24,33,44,56,69,83,98,115,133,152,172,193,215,238,263,289,

%T 316,344,373,403,434,466,500,535,571,608,646,685,725,766,808,851,896,

%U 942,989,1037,1086,1136,1187,1239,1292,1346,1401,1458,1516

%N a(n) = a(n-1) + c(n-1) for n >= 2, a( ) increasing, given a(1)=4; where c( ) is complement of a( ).

%H Ivan Neretin, <a href="/A022936/b022936.txt">Table of n, a(n) for n = 1..10000</a>

%t Fold[Append[#1, #1[[#2]] + Complement[Range@Max@#1, #1][[#2]]] &, {4},

%t Range[50]] (* _Ivan Neretin_, Apr 04 2016 *)

%Y Cf. A005228 and references therein.

%K nonn

%O 1,1

%A _Clark Kimberling_

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 29 11:14 EDT 2024. Contains 371278 sequences. (Running on oeis4.)