|
|
A116525
|
|
a(0)=1, a(1)=1, a(n) = 11*a(n/2) for even n, and a(n) = 10*a((n-1)/2) + a((n+1)/2) for odd n >= 3.
|
|
5
|
|
|
0, 1, 11, 21, 121, 131, 231, 331, 1331, 1341, 1441, 1541, 2541, 2641, 3641, 4641, 14641, 14651, 14751, 14851, 15851, 15951, 16951, 17951, 27951, 28051, 29051, 30051, 40051, 41051, 51051, 61051, 161051, 161061, 161161, 161261, 162261, 162361, 163361, 164361
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
Let M =
1, 0, 0, 0, 0, ...
11, 0, 0, 0, 0, ...
10, 1, 0, 0, 0, ...
0, 11, 0, 0, 0, ...
0, 10, 1, 0, 0, ...
0, 0, 11, 0, 0, ...
0, 0, 10, 1, 0, ...
...
Then lim_{k->infinity} M^k converges to a single nonzero column giving the sequence.
The sequence divided by its aerated variant is (1, 11, 10, 0, 0, 0, ...). (End)
|
|
LINKS
|
|
|
FORMULA
|
Let r(x) = (1 + 11x + 10x^2). The sequence is r(x) * r(x^2) * r(x^4) * r(x^8) * ... - Gary W. Adamson, Aug 30 2016
|
|
MAPLE
|
a:=proc(n) if n=0 then 0 elif n=1 then 1 elif n mod 2 = 0 then 11*a(n/2) else 10*a((n-1)/2)+a((n+1)/2) fi end: seq(a(n), n=0..42);
|
|
MATHEMATICA
|
b[0] := 0; b[1] := 1; b[n_?EvenQ] := b[n] = 11*b[n/2]; b[n_?OddQ] := b[n] = 10*b[(n - 1)/2] + b[(n + 1)/2]; a = Table[b[n], {n, 1, 25}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|