login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A241235 a(n) = number of times n appears in A006949. 2

%I #7 Apr 28 2014 13:02:29

%S 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,

%T 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,

%U 1,2,1,4,1,2,1,3,1,2,1,5,1,2,1,3,1,2

%N a(n) = number of times n appears in A006949.

%C Is this (with an exception at n=1) the same as A135560? - _R. J. Mathar_, Apr 26 2014

%H Reinhard Zumkeller, <a href="/A241235/b241235.txt">Table of n, a(n) for n = 1..10000</a>

%o (Haskell)

%o a241235 n = a241235_list !! (n-1)

%o a241235_list = map length $ group a006949_list

%Y Cf. A051135.

%K nonn

%O 1,1

%A _Reinhard Zumkeller_, Apr 17 2014

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 10:49 EDT 2024. Contains 371935 sequences. (Running on oeis4.)