A132157 a(n) = number of times n occurs in A063882.

4, 1, 1, 1, 2, 2, 1, 2, 2, 1, 3, 2, 1, 2, 2, 1, 3, 2, 1, 2, 2, 3, 2, 1, 2, 2, 2, 1, 3, 2, 1, 2, 2, 3, 2, 1, 2, 2, 2, 1, 3, 2, 2, 3, 2, 1, 2, 2, 2, 1, 3, 2, 2, 1, 2, 2, 2, 3, 2, 1, 2, 2, 2, 1, 3, 2, 2, 3, 2, 1, 2, 2, 2, 1, 3, 2, 2, 1, 2, 2, 2, 3, 2, 1, 3, 2, 2, 3, 2, 1, 2, 2, 2, 1, 3, 2, 2, 1, 2

Offset: 1

Author

N. J. A. Sloane, Nov 06 2007

Keywords

• nonn

Comments

a(A202016(n)) = 1. [Reinhard Zumkeller, Dec 08 2011]

Links

• N. J. A. Sloane, Table of n, a(n) for n = 1..200 [Taken from the Balamohan et al. reference]
• B. Balamohan, A. Kuznetsov and S. Tanny, On the behavior of a variant of Hofstadter's Q-sequence, J. Integer Sequences, Vol. 10 (2007), #07.7.1.
• Index entries for Hofstadter-type sequences

Programs

Haskell

import Data.List (group)
a132157 n = a132157_list !! (n-1)
a132157_list = (map length) (group a063882_list)
-- Reinhard Zumkeller, Dec 08 2011