Skip to Main content Skip to Navigation
Journal articles

A Combinatorial Approach to the Tanny Sequence

Abstract : The Tanny sequence T (i) is a sequence defined recursively as T(i) = T(i - 1 - T(i - 1)) + T(i - 2 - T(i - 2)), T(0) = T(1) = T(2) = 1. In the first part of this paper we give combinatorial proofs of all the results regarding T(i), that Tanny proved in his paper "A well-behaved cousin of the Hofstadter sequence", Discrete Mathematics, 105(1992), pp. 227-239, using algebraic means. In most cases our proofs turn out to be simpler and shorter. Moreover, they give a "visual" appeal to the theory developed by Tanny. We also generalize most of Tanny's results. In the second part of the paper we present many new results regarding T(i) and prove them combinatorially. Given two integers n and k, it is interesting to know if T(n) = k or not. In this paper we characterize such numbers.
Document type :
Journal articles
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-00990501
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Tuesday, May 13, 2014 - 3:39:38 PM
Last modification on : Saturday, August 11, 2018 - 11:22:01 AM
Long-term archiving on: : Monday, April 10, 2017 - 10:15:18 PM

File

1320-6372-1-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00990501, version 1

Collections

Citation

Anita Das. A Combinatorial Approach to the Tanny Sequence. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2011, Vol. 13 no. 2 (2), pp.97--108. ⟨hal-00990501⟩

Share

Metrics

Record views

121

Files downloads

830