login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022938 a(n) = a(n-1) + c(n-1) for n >= 2, a( ) increasing, given a(1)=6; where c( ) is complement of a( ). 2

%I

%S 6,7,9,12,16,21,29,39,50,63,77,92,109,127,146,166,188,211,235,260,286,

%T 313,341,371,402,434,467,501,536,572,609,647,687,728,770,813,857,902,

%U 948,995,1043,1092,1143,1195,1248,1302,1357,1413,1470,1528

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

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

%t Fold[Append[#1, #1[[#2]] + Complement[Range@Max@#1, #1][[#2]]] &, {6}, 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 18 07:42 EDT 2019. Contains 328146 sequences. (Running on oeis4.)