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!)
A342749 a(n) = number of runs in n-th word in A341334. 2

%I #8 Apr 10 2021 22:35:44

%S 1,1,2,1,1,2,2,2,1,3,2,3,1,2,1,2,4,2,3,3,2,2,2,1,3,3,4,2,2,4,3,3,2,3,

%T 3,2,4,1,4,1,3,4,3,3,2,2,4,4,2,3,2,5,4,3,3,2,5,3,1,4,4,2,3,3,4,4,2,3,

%U 2,3,3,4,2,4,3,3,3,2,4,6,4,5,3,4,2,2

%N a(n) = number of runs in n-th word in A341334.

%C First 20 words in A341334: 0, 1, 10, 00, 11, 110, 01, 100, 111, 010, 1110, 101, 000, 1100, 1111, 011, 1010, 11110, 0110, 1101.

%C The 11th word, 1110, has 2 runs (111 and 0), so that a(11) = 2.

%t (See A341334.)

%Y Cf. A341334.

%K base,nonn

%O 1,3

%A _Clark Kimberling_, Apr 08 2021

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 12 22:48 EDT 2024. Contains 371639 sequences. (Running on oeis4.)