login
The OEIS is supported by the many generous donors to the OEIS 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022938 a(n) = a(n-1) + c(n-1) for n >= 2, a( ) increasing, given a(1)=6; where c( ) is complement of a( ). 2
6, 7, 9, 12, 16, 21, 29, 39, 50, 63, 77, 92, 109, 127, 146, 166, 188, 211, 235, 260, 286, 313, 341, 371, 402, 434, 467, 501, 536, 572, 609, 647, 687, 728, 770, 813, 857, 902, 948, 995, 1043, 1092, 1143, 1195, 1248, 1302, 1357, 1413, 1470, 1528 (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, #1][[#2]]] &, {6}, Range[50]] (* Ivan Neretin, Apr 04 2016 *)

CROSSREFS

Cf. A005228 and references therein.

Sequence in context: A309961 A108595 A186079 * A048585 A169761 A049304

Adjacent sequences: A022935 A022936 A022937 * A022939 A022940 A022941

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 26 14:22 EST 2022. Contains 358362 sequences. (Running on oeis4.)