|
Search: id:A064353
|
|
|
| A064353 |
|
Kolakoski-(1,3) sequence: a(n) is length of n-th run. |
|
+0
10
|
|
| 1, 3, 3, 3, 1, 1, 1, 3, 3, 3, 1, 3, 1, 3, 3, 3, 1, 1, 1, 3, 3, 3, 1, 3, 3, 3, 1, 3, 3, 3, 1, 1, 1, 3, 3, 3, 1, 3, 1, 3, 3, 3, 1, 1, 1, 3, 3, 3, 1, 3, 3, 3, 1, 1, 1, 3, 3, 3, 1, 3, 3, 3, 1, 1, 1, 3, 3, 3, 1, 3, 1, 3, 3, 3, 1, 1, 1, 3, 3, 3, 1, 3, 3, 3, 1, 3, 3, 3, 1, 1, 1, 3, 3, 3, 1, 3, 1, 3, 3, 3, 1, 1, 1, 3, 3
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
The frequency of the number '3' is 0.6027847... See problem A in http://www.math.leidenuniv.nl/%7Enaw/serie5/deel05/jun2004/pdf/uwc.pdf Solution: http://www.jaapspies.nl/mathfiles/opgave2004-2A.pdf - Jaap Spies (j.spies(AT)hccnet.nl), Dec 12 2004
|
|
REFERENCES
|
E. Angelini, "Jeux de suites", in Dossier Pour La Science, pp. 32-35, Volume 59 (Jeux math'), April/June 2008, Paris.
|
|
LINKS
|
Michael Baake and Bernd Sing, Kolakoski-(3,1) is a (deformed) model set
|
|
PROGRAM
|
(Matlab) A = [1 3 3 3]; i = 3; next = 1; while length(A) < 140 A = [A next*ones(1, A(i))]; i = i + 1; next = 4 - next; end
|
|
CROSSREFS
|
Cf. A000002, A071820, A071907, A071928, A071942.
Sequence in context: A126066 A130974 A131289 this_sequence A080311 A135368 A119560
Adjacent sequences: A064350 A064351 A064352 this_sequence A064354 A064355 A064356
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Jul 16 2002
|
|
|
Search completed in 0.002 seconds
|
