|
|
A298004
|
|
Solution b( ) of the complementary equation a(n) = a(1)*b(n-1) - a(0)*b(n-2) + 3*n, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.
|
|
2
|
|
|
3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 16, 17, 18, 20, 21, 22, 24, 25, 26, 28, 29, 30, 32, 33, 34, 36, 37, 38, 39, 40, 42, 43, 45, 46, 47, 49, 50, 51, 52, 53, 55, 56, 58, 59, 60, 62, 63, 64, 65, 66, 68, 69, 71, 72, 73, 75, 76, 77, 78, 79, 81, 82, 84, 85, 86
(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. The solution a( ) is given at A297836. See A297830 for a guide to related sequences.
Conjecture: 7/10 < a(n) - n*L < 3 for n >= 1, where L = (-1 + sqrt(13))/2.
|
|
LINKS
|
|
|
MATHEMATICA
|
a[0] = 1; a[1] = 2; b[0] = 3; b[1] = 4;
a[n_] := a[n] = a[1]*b[n - 1] - a[0]*b[n - 2] + 3 n;
j = 1; While[j < 80000, k = a[j] - j - 1;
While[k < a[j + 1] - j + 1, b[k] = j + k + 2; k++]; j++]; k
u = Table[a[n], {n, 0, k}]; (* A297836 *)
v = Table[b[n], {n, 0, k}]; (* A298004 *)
Take[u, 50]
Take[v, 50]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|