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.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A294482 Solution of the complementary equation a(n) = a(n-2) + b(n-1) + n + 1, where a(0) = 1, a(1) = 3, b(0) = 2. 2
1, 3, 8, 12, 19, 25, 35, 43, 55, 66, 80, 93, 109, 124, 142, 160, 180, 200, 222, 244, 269, 293, 320, 346, 375, 403, 434, 464, 497, 530, 565, 600, 637, 674, 713, 752, 794, 835, 879, 922, 968, 1013, 1061, 1108, 1158, 1207, 1259, 1311, 1365, 1419, 1475, 1531 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
The complementary sequences a() and b() are uniquely determined by the titular equation and initial values. See A294476 for a guide to related sequences.
LINKS
Clark Kimberling, Complementary equations, J. Int. Seq. 19 (2007), 1-13.
EXAMPLE
a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, so that
a(2) = a(0) + b(1) + 3 = 8
Complement: (b(n)) = (2, 4, 5, 6, 7, 9, 10, 11, 13, 15, ...)
MATHEMATICA
mex := First[Complement[Range[1, Max[#1] + 1], #1]] &;
a[0] = 1; a[1] = 3; b[0] = 2;
a[n_] := a[n] = a[n - 2] + b[n - 1] + n + 1;
b[n_] := b[n] = mex[Flatten[Table[Join[{a[n]}, {a[i], b[i]}], {i, 0, n - 1}]]];
Table[a[n], {n, 0, 40}] (* A294482 *)
Table[b[n], {n, 0, 10}]
CROSSREFS
Sequence in context: A086813 A287081 A352814 * A103888 A014255 A350221
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Nov 03 2017
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 May 12 17:44 EDT 2024. Contains 372492 sequences. (Running on oeis4.)