login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


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

%I #10 Apr 04 2016 18:23:50

%S 5,6,8,11,15,22,31,41,53,66,80,96,113,131,150,170,191,214,238,263,289,

%T 316,344,373,403,435,468,502,537,573,610,648,687,727,769,812,856,901,

%U 947,994,1042,1091,1141,1192,1244,1298,1353,1409,1466,1524,1583

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

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

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

%Y Cf. A005228 and references therein.

%K nonn

%O 1,1

%A _Clark Kimberling_

%E Missing 1192 from Kevin Ryde, Feb 19 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 22 16:18 EDT 2024. Contains 376119 sequences. (Running on oeis4.)