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

%I #7 Apr 04 2016 18:53:13

%S 2,3,6,8,13,17,23,28,35,42,50,58,68,77,88,98,110,122,135,148,162,177,

%T 192,208,224,241,258,277,295,315,334,355,375,398,419,443,465,490,513,

%U 539,564,591,617,645,672,701,729,760,789,821,851,884,915

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

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

%t Fold[Append[#1, #1[[-2]] + Complement[Range[Max@#1 + 2], #1][[#2]]] &, {2, 3}, Range[2, 52]] (* _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 May 4 03:52 EDT 2024. Contains 372225 sequences. (Running on oeis4.)