|
Search: id:A081832
|
|
|
| A081832 |
|
a(1)=a(2)=1, a(n)=a(n+1-2*a(n-1))+a(n-2*a(n-2)). |
|
+0
1
|
|
| 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 12, 12, 12, 12, 12, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 16, 16, 16, 16, 16, 16, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 20, 20, 20, 20, 20, 21, 21, 21, 22, 22, 22
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Unlike the Hofstadter Q-sequence, this one seems to be an increasing sequence.
|
|
FORMULA
|
Conjecture : a(n)/n -> C=1/4; a(n+1)-a(n)=1 or 0, first values of differences are : 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, ....
|
|
CROSSREFS
|
Cf. A005185.
Sequence in context: A026819 A046155 A137214 this_sequence A034887 A082964 A099741
Adjacent sequences: A081829 A081830 A081831 this_sequence A081833 A081834 A081835
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 10 2003
|
|
|
Search completed in 0.002 seconds
|
