|
|
A278066
|
|
Relative of Hofstadter Q-sequence: a(1) = 5, a(2) = 2; thereafter a(n) = a(n-a(n-1)) + a(n-a(n-2)).
|
|
14
|
|
|
5, 2, 5, 2, 5, 7, 2, 12, 2, 12, 2, 12, 7, 4, 14, 14, 10, 14, 7, 14, 6, 26, 10, 4, 20, 33, 2, 33, 2, 33, 2, 33, 2, 38, 2, 38, 2, 38, 7, 4, 40, 40, 10, 40, 7, 14, 6, 78, 10, 4, 46, 85, 2, 85, 2, 85, 2, 85, 2, 85, 2, 85, 2, 85, 2, 85, 2, 85, 2, 85, 2, 85, 2, 85, 2, 85, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
In calculating terms of this sequence, use the convention that a(n)=0 for n<=0.
Most terms in this sequence alternate between 2 and a term of A275163. These runs are separated by 18 other terms, and each run is approximately twice as long as the previous.
|
|
LINKS
|
|
|
FORMULA
|
a(1) = 5, a(2) = 2, a(3) = 5, a(4) = 2, a(5) = 5, a(6) = 7, a(7) = 2; thereafter, for k>=0,
|
|
MATHEMATICA
|
a[1] = 5; a[2] = 2; a[n_] := a[n] = If[n < 1, 0, a[n-a[n-1]] + a[n-a[n-2]]];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|