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!)
A022949 a(n) = a(n-1) + c(n) for n >= 3, a( ) increasing, given a(1)=1 a(2)=6; where c( ) is complement of a( ). 2

%I #8 Apr 05 2016 07:28:07

%S 1,6,10,15,22,30,39,50,62,75,89,105,122,140,159,179,200,223,247,272,

%T 298,325,353,382,413,445,478,512,547,583,620,658,698,739,781,824,868,

%U 913,959,1006,1054,1103,1154,1206,1259,1313,1368,1424,1481,1539

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

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

%t Fold[Append[#1, #1[[-1]] + Complement[Range[Max@#1 + 3], #1][[#2]]] &, {1, 6}, Range[3, 50]] (* _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 March 28 17:42 EDT 2024. Contains 371254 sequences. (Running on oeis4.)