|
Search: id:A005434
|
|
|
| A005434 |
|
Correlations of length n.
(Formerly M0555)
|
|
+0
2
|
|
| 1, 2, 3, 4, 6, 8, 10, 13, 17, 21, 27, 30, 37, 47, 57, 62, 75, 87, 102, 116, 135, 155, 180, 194, 220, 254, 289, 312, 359, 392, 438, 479, 538, 595, 664, 701, 772, 863, 956, 1005, 1115, 1205, 1317, 1414, 1552, 1677, 1836, 1920, 2074, 2249, 2444
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics, Addison-Wesley Publ., 2nd Ed., 1994. Section 8.4: Flipping Coins
L. J. Guibas, Periodicities in Strings, Combinatorial Algorithms on Words 1985, NATO ASI Vol. F12, 257-269
L. J. Guibas and A. M. Odlyzko, Periods in Strings, Journal of Combinatorial Theory A 30:1 (1980) 19-42
L. J. Guibas and A. M. Odlyzko, String Overlaps, Patterns, Matching and Nontransitive Games, Journal of Combinatorial Theory A 30 (March 1981) 183-208
H. Harborth, Endliche 0-1-Folgen mit gleichen Teilbloecken, Journal fuer Mathematik, 271 (1974) 139-154
E. Rivals, S. Rahmann, Combinatorics of Periods in Strings, Journal of Combinatorial Theory - Series A, Vol. 104(1) (2003), pp. 95-113.
|
|
LINKS
|
T. Sillke, Autocorrelation Range
T. Sillke, kappa sequence for words of length n
T. Sillke, The autocorrelation function
E. H. Rivals, Autocorrelation of Strings.
E. H. Rivals, S. Rahmann Combinatorics of Periods in Strings
|
|
CROSSREFS
|
Cf. A045690.
Cf. A018819 (related to a lower bound for autocorrelations), A045690 (the number of binary strings sharing the same autocorrelation).
Adjacent sequences: A005431 A005432 A005433 this_sequence A005435 A005436 A005437
Sequence in context: A067996 A027585 A123015 this_sequence A027589 A039851 A028290
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
Simon Plouffe (plouffe(AT)math.uqam.ca), njas
|
|
EXTENSIONS
|
More terms and additional references from TORSTEN.SILLKE(AT)LHSYSTEMS.COM
|
|
|
Search completed in 0.002 seconds
|
