The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A022442 a(n) = c(n) + c(n-1) where c is the sequence of numbers not in a. 3
 2, 4, 8, 11, 13, 16, 19, 22, 26, 29, 32, 35, 38, 41, 44, 47, 49, 52, 55, 58, 61, 64, 67, 70, 73, 76, 79, 82, 85, 88, 91, 94, 98, 101, 104, 107, 110, 113, 116, 119, 122, 125, 128, 131, 134, 137 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Ivan Neretin, Table of n, a(n) for n = 0..10000 R. Stephan, Some divide-and-conquer sequences ... R. Stephan, Table of generating functions FORMULA For n>0, a(n)=b(n) with b(0)=0, b(2n) = -b(n)+9n+3, b(2n+1) = -b(n)+9n+6-2[n==0]. - Ralf Stephan, Oct 23 2003 MATHEMATICA Fold[Append[#1, Plus @@ Complement[Range[Max@#1 + 3], #1][[{#2 + 1, #2 + 2}]]] &, {2, 4}, Range[44]] (* Ivan Neretin, Mar 30 2017 *) CROSSREFS Cf. A099467 (complement). Cf. A022424 and references therein. Sequence in context: A078649 A161607 A318206 * A308163 A056689 A034037 Adjacent sequences: A022439 A022440 A022441 * A022443 A022444 A022445 KEYWORD nonn,easy 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.

Last modified June 12 11:18 EDT 2024. Contains 373331 sequences. (Running on oeis4.)