Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
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!)
A295060 Solution of the complementary equation a(n) = 2*a(n-1) - b(n-2), where a(0) = 3, a(1) = 5, b(0) = 1, b(1) = 2, and (a(n)) and (b(n)) are increasing complementary sequences. 2
3, 5, 9, 16, 28, 50, 93, 178, 346, 681, 1350, 2687, 5360, 10705, 21393, 42768, 85517, 171014, 342007, 683992, 1367961, 2735898, 5471771, 10943516, 21887005, 43773981, 87547932, 175095833, 350191634 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
The increasing complementary sequences a() and b() are uniquely determined by the titular equation and initial values. See A295053 for a guide to related sequences.
LINKS
Clark Kimberling, Complementary equations, J. Int. Seq. 19 (2007), 1-13.
EXAMPLE
a(0) = 1, a(1) = 4, b(0) = 2, b(1) = 3
a(2) = 2*a(1) - b(0) = 9
Complement: (b(n)) = (1, 2, 4, 6, 7, 8, 10, 11, 12, 13, 14, ...)
MATHEMATICA
mex := First[Complement[Range[1, Max[#1] + 1], #1]] &;
a[0] = 3; a[1] = 5; b[0] = 1; b[1]=2;
a[n_] := a[n] = 2 a[n - 1] - b[n - 2];
b[n_] := b[n] = mex[Flatten[Table[Join[{a[n]}, {a[i], b[i]}], {i, 0, n - 1}]]];
Table[a[n], {n, 0, 18}] (* A295060 *)
Table[b[n], {n, 0, 10}]
CROSSREFS
Cf. A295053.
Sequence in context: A129973 A018159 A094980 * A069818 A227233 A054180
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Nov 18 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 August 6 00:15 EDT 2024. Contains 374957 sequences. (Running on oeis4.)