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

%I #8 Apr 05 2016 07:27:44

%S 1,3,8,14,21,30,40,51,63,76,91,107,124,142,161,181,203,226,250,275,

%T 301,328,356,385,416,448,481,515,550,586,623,661,700,741,783,826,870,

%U 915,961,1008,1056,1105,1155,1207,1260,1314,1369,1425,1482,1540

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

%H Ivan Neretin, <a href="/A022947/b022947.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, 3}, 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 April 25 13:27 EDT 2024. Contains 371971 sequences. (Running on oeis4.)