Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A022294
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A022294 a(n) = least k>1 such that first n terms of Kolakoski sequence A000002 repeat beginning at k-th term. +0
3
4, 5, 7, 7, 10, 10, 10, 37, 37, 37, 37, 55, 55, 55, 55, 55, 55, 55, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 460, 460, 460, 460, 460, 460, 460, 460, 460, 460, 460, 460, 460, 460, 460, 15585, 15585, 15585, 15585, 15585, 15585, 15585, 15585, 15585, 15585, 15585, 15585 (list; graph; listen)
OFFSET

1,1

EXAMPLE

a(3) and a(4) are both 7 because A000002 begins 1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 2, ... and 1, 2, 2 and 1, 2, 2, 1 both repeat at position 7.

CROSSREFS

Cf. A074300.

Sequence in context: A033557 A088298 A075992 this_sequence A087202 A010666 A164515

Adjacent sequences: A022291 A022292 A022293 this_sequence A022295 A022296 A022297

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 16 13:01 EST 2009. Contains 170825 sequences.


AT&T Labs Research