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

%I #9 Apr 05 2016 10:26:19

%S 1,2,3,4,5,7,10,12,15,18,21,26,29,34,38,43,49,53,59,65,71,79,84,91,98,

%T 106,115,121,130,138,147,157,165,175,184,194,205,215,226,236,248,260,

%U 271,283,294,308,321,333,346,358,374,388,401,415,428,446,461

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

%C Here "complement" refers to the numbers not in the sequence.

%H Ivan Neretin, <a href="/A022957/b022957.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, 3, 4, 5}, Range[52]] (* _Ivan Neretin_, Apr 05 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 24 04:14 EDT 2024. Contains 371918 sequences. (Running on oeis4.)