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!)
A022939 Unique increasing sequence satisfying a(n) = a(n-2) + c(n-2); where c( ) is complement of a( ). 3

%I #7 Apr 04 2016 18:52:31

%S 1,2,4,7,10,15,19,26,31,39,45,55,62,73,82,94,104,117,128,142,155,170,

%T 184,200,216,233,250,268,286,305,324,345,365,387,408,431,454,478,502,

%U 527,552,578,604,631,658,687,715,745,774,805,835,868,899

%N Unique increasing sequence satisfying a(n) = a(n-2) + c(n-2); where c( ) is complement of a( ).

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

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

%Y Cf. A005228 and references therein.

%K nonn

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)