This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A022940 a(n) = a(n-1) + b(n-2) for n >= 3, a( ) increasing, given a(1) = 1, a(2) = 3; where b( ) is complement of a( ). 10

%I

%S 1,3,5,9,15,22,30,40,51,63,76,90,106,123,141,160,180,201,224,248,273,

%T 299,326,354,383,414,446,479,513,548,584,621,659,698,739,781,824,868,

%U 913,959,1006,1054,1103,1153,1205,1258,1312,1367,1423,1480

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

%C From _Clark Kimberling_, Oct 30 2017: (Start)

%C The complementary sequences a() and b() are uniquely determined by the titular equation and initial values. The initial values of each sequence in the following guide are a(0) = 1, a(2) = 3, b(0) = 2, b(1) = 4:

%C here: a(n) = a(n-1) + b(n-2) [with a different offset]

%C A294397: a(n) = a(n-1) + b(n-2) + 1;

%C A294398: a(n) = a(n-1) + b(n-2) + 2;

%C A294399: a(n) = a(n-1) + b(n-2) + 3;

%C A294400: a(n) = a(n-1) + b(n-2) + n;

%C A294401: a(n) = a(n-1) + b(n-2) + 2*n.

%C (End)

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

%H Clark Kimberling, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL10/Kimberling/kimberling26.html">Complementary equations</a>, J. Int. Seq. 19 (2007), 1-13.

%e a(1) = 1, a(2) = 3, b(1) = 2, b(2) = 4, so that a(3) = a(2) + a(1) + b(2) = 5.

%e Complement: {b(n)} = {2, 4, 6, 7, 8, 10, 11, 12, 13, 14, 16, ...}

%t Fold[Append[#1, #1[[-1]] + Complement[Range[Max@#1 + 1], #1][[#2]]] &, {1, 3}, Range] (* _Ivan Neretin_, Apr 04 2016 *)

%Y Cf. A005228 and references therein.

%Y Cf. A293076, A293765, A294381.

%K nonn,easy

%O 1,2

%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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 17 12:56 EDT 2019. Contains 328112 sequences. (Running on oeis4.)