The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A132157 a(n) = number of times n occurs in A063882. 3
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 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. PROG (Haskell) import Data.List (group) a132157 n = a132157_list !! (n-1) a132157_list = (map length) (group a063882_list) -- Reinhard Zumkeller, Dec 08 2011 CROSSREFS Sequence in context: A039927 A336722 A073802 * A103163 A128211 A199393 Adjacent sequences:  A132154 A132155 A132156 * A132158 A132159 A132160 KEYWORD nonn AUTHOR N. J. A. Sloane, Nov 06 2007 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 14 04:27 EDT 2021. Contains 343872 sequences. (Running on oeis4.)