|
|
A088431
|
|
Half of the (n+1)-st component of the continued fraction expansion of Sum_{k>=0} 1/2^(2^k).
|
|
5
|
|
|
2, 1, 2, 2, 3, 2, 1, 2, 3, 1, 2, 3, 2, 2, 1, 2, 3, 1, 2, 2, 3, 2, 1, 3, 2, 1, 2, 3, 2, 2, 1, 2, 3, 1, 2, 2, 3, 2, 1, 2, 3, 1, 2, 3, 2, 2, 1, 3, 2, 1, 2, 2, 3, 2, 1, 3, 2, 1, 2, 3, 2, 2, 1, 2, 3, 1, 2, 2, 3, 2, 1, 2, 3, 1, 2, 3, 2, 2, 1, 2, 3, 1, 2, 2, 3, 2, 1, 3, 2, 1, 2, 3, 2, 2, 1, 3, 2, 1, 2, 2, 3, 2, 1, 2, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
To construct the sequence use the rule: a(1)=2, then a(a(1) + a(2) + ... + a(n) + 1) = 2 and fill in any undefined places with the sequence 1,3,1,3,1,3,1,3,1,3,1,3,....
This sequence appears to be the sequence of run lengths of the regular paperfolding sequence A014577, i.e., the latter starts as follows: 2 zeros, 1 one, 2 zeros, 2 ones, etc. - Dimitri Hendriks, May 06 2010
|
|
LINKS
|
|
|
FORMULA
|
a(n) = (1/2)*A007400(n+1); a(a(1) + a(2) + ... + a(n) + 1) = 2.
|
|
EXAMPLE
|
Example to illustrate the comment: a(a(1)+1)=a(3)=2 and a(2) is undefined. The rule requires a(2)=1. Next, a(a(1)+a(2)+1)=a(4)=2, a(a(1)+a(2)+a(3)+1)=a(6)=2 and a(5) is undefined. The rule now requires a(5)=3.
|
|
MATHEMATICA
|
a[n_] := a[n] = Which[n < 3, {0, 1, 4}[[n + 1]], Mod[n, 8] == 1, a[(n + 1)/2], Mod[n, 8] == 2, a[(n + 2)/2], True, {2, 0, 0, 2, 4, 4, 6, 4, 2, 0, 0, 2, 4, 6, 4, 4}[[Mod[n, 16] + 1]]]; Array[a[# + 1]/2 &, 98] (* after Jean-François Alcover at A007400 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|