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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022943 a(n) = a(n-2) + c(n-1) for n >= 3, a( ) increasing, given a(1)=2, a(2)=3, where c( ) is complement of a( ). 1
2, 3, 6, 8, 13, 17, 23, 28, 35, 42, 50, 58, 68, 77, 88, 98, 110, 122, 135, 148, 162, 177, 192, 208, 224, 241, 258, 277, 295, 315, 334, 355, 375, 398, 419, 443, 465, 490, 513, 539, 564, 591, 617, 645, 672, 701, 729, 760, 789, 821, 851, 884, 915 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

MATHEMATICA

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

CROSSREFS

Cf. A005228 and references therein.

Sequence in context: A101136 A036957 A251260 * A068491 A239952 A240076

Adjacent sequences:  A022940 A022941 A022942 * A022944 A022945 A022946

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 21 12:51 EST 2017. Contains 295001 sequences.