|
| |
|
|
A059139
|
|
A hierarchical sequence (W2{2}*c - see A059126).
|
|
0
| |
|
|
4, 7, 4, 10, 4, 7, 4, 13, 4, 7, 4, 10, 4, 7, 4, 16, 4, 7, 4, 10, 4, 7, 4, 13, 4, 7, 4, 10, 4, 7, 4, 19, 4, 7, 4, 10, 4, 7, 4, 13, 4, 7, 4, 10, 4, 7, 4, 16, 4, 7, 4, 10, 4, 7, 4, 13, 4, 7, 4, 10, 4, 7, 4, 22, 4, 7, 4, 10, 4, 7, 4, 13, 4, 7, 4, 10, 4, 7, 4, 16, 4, 7, 4, 10, 4, 7, 4, 13, 4, 7, 4, 10, 4
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| Let the general sequence H(a,b,n) = a*A007814(n+1) + b, then this sequence is H(3,4). Other hierarchical sequences of this type are A059132 (H(6,4)), A059141 (H(7,11)), A059144 (H(9,15)), A059134 (H(21,11)), A059137 (H(36,18)).
|
|
|
LINKS
| R. Stephan, Some divide-and-conquer sequences ...
J. Wallgren, Hierarchical sequences
|
|
|
FORMULA
| 4 + 3*A007814(n-1). a(2n) = 4, a(2n+1) = a(n) + 3. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Oct 09 2003
|
|
|
CROSSREFS
| Sequence in context: A170863 A021682 A094692 * A110669 A106027 A101159
Adjacent sequences: A059136 A059137 A059138 * A059140 A059141 A059142
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Jonas Wallgren (jonwa(AT)ida.liu.se), Jan 19 2001
|
| |
|
|
