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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A241235 a(n) = number of times n appears in A006949. 2
3, 3, 1, 4, 1, 2, 1, 5, 1, 2, 1, 3, 1, 2, 1, 6, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 7, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 5, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 8, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 5, 1, 2, 1, 3, 1, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Is this (with an exception at n=1) the same as A135560? - R. J. Mathar, Apr 26 2014

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

PROG

(Haskell)

a241235 n = a241235_list !! (n-1)

a241235_list = map length $ group a006949_list

CROSSREFS

Cf. A051135.

Sequence in context: A331901 A306148 A106836 * A125607 A137876 A016604

Adjacent sequences:  A241232 A241233 A241234 * A241236 A241237 A241238

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Apr 17 2014

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 22 14:30 EDT 2021. Contains 343177 sequences. (Running on oeis4.)