A well-behaved cousin of the Hofstadter sequence (Q1199490): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3872528 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4792066 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Conway's Challenge Sequence / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4692934 / rank | |||
Normal rank |
Latest revision as of 16:17, 16 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A well-behaved cousin of the Hofstadter sequence |
scientific article |
Statements
A well-behaved cousin of the Hofstadter sequence (English)
0 references
16 January 1993
0 references
Let \(T(n)\) be a sequence of integers, defined by the recursion \(T(n)=T(n- 1-T(n-1))+T(n-2-T(n-2))\) for \(n>2\) with \(T(0)=T(1)=T(2)=1\). The treatment of the sequences similar than this is hard in general, as we know very little about them. So the results about the sequence \(T(n)\) obtained in the present paper are very interesting. Among others the author proves that \(T(n+1)=T(n)\) or \(T(n)+1\) for any \(n>0\); there are exactly \(x+2\) consecutive integers \(n\) for which \(T(n)=2^ x\); furthermore \(T(n)/n\to 1/2\) as \(n\to\infty\).
0 references
Hofstadter sequence
0 references
recursive sequence of integers
0 references