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

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A022427 a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a. 3
 1, 2, 3, 10, 12, 14, 16, 19, 22, 26, 30, 33, 37, 39, 43, 45, 48, 51, 53, 56, 59, 61, 65, 67, 70, 73, 76, 79, 82, 85, 88, 91, 95, 97, 101, 104, 107, 111, 113, 117, 120, 123, 126, 129, 132, 135, 139, 141, 145, 147, 151, 153, 157, 159, 163, 165, 169, 171 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Ivan Neretin, Table of n, a(n) for n = 0..10000 J-P. Bode, H. Harborth, C. Kimberling, Complementary Fibonacci sequences, Fibonacci Quarterly 45 (2007), 254-264. MATHEMATICA Fold[Append[#1, Plus @@ Complement[Range[Max@#1 + 3], #1][[{#2, #2 + 2}]]] &, {1, 2, 3}, Range[55]] (* Ivan Neretin, Mar 28 2017 *) CROSSREFS Cf. A022424 and references therein. Cf. A299536. Sequence in context: A302388 A006092 A015859 * A061868 A004679 A168060 Adjacent sequences:  A022424 A022425 A022426 * A022428 A022429 A022430 KEYWORD nonn AUTHOR 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.

Last modified January 16 06:48 EST 2021. Contains 340204 sequences. (Running on oeis4.)