login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022951 a(n) = a(n-1) + c(n) for n >= 3, a( ) increasing, given a(1)=2, a(2)=3; where c( ) is complement of a( ). 1
2, 3, 8, 14, 21, 30, 40, 51, 63, 76, 91, 107, 124, 142, 161, 181, 203, 226, 250, 275, 301, 328, 356, 385, 416, 448, 481, 515, 550, 586, 623, 661, 700, 741, 783, 826, 870, 915, 961, 1008, 1056, 1105, 1155, 1207, 1260, 1314, 1369, 1425, 1482, 1540 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

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

LINKS

Ivan Neretin, Table of n, a(n) for n = 1..10000

FORMULA

a(n)=A022947(n), n>1. - R. J. Mathar, May 28 2008

MATHEMATICA

Fold[Append[#1, #1[[-1]] + Complement[Range[Max@#1 + 3], #1][[#2]]] &, {2, 3}, Range[3, 50]] (* Ivan Neretin, Apr 05 2016 *)

CROSSREFS

Cf. A005228 and references therein.

Sequence in context: A145929 A153865 A331820 * A247124 A171237 A173149

Adjacent sequences:  A022948 A022949 A022950 * A022952 A022953 A022954

KEYWORD

nonn

AUTHOR

Clark Kimberling

STATUS

approved

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 December 4 02:40 EST 2021. Contains 349469 sequences. (Running on oeis4.)