Sequences of Integers

Here we are mainly, but not entirely, concerned with infinite sequences; there is some overlap with sections C and A. An excellent text and source of problems is H. Halberstam & K. F. Roth, Sequences, 2nd edition, Springer-Verlag, New York, 1982.

[1]  Jeffrey C. Lagarias,et al.  On the Density of Sequences of Integers the Sum of No Two of which Is a Square. I. Arithmetic Progressions , 1982, J. Comb. Theory, Ser. A.

[2]  An extremal result for sum-free sequences , 1980 .

[3]  James E. Baumgartner,et al.  A Short Proof of Hindman's Theorem , 1974, J. Comb. Theory, Ser. A.

[4]  Micha Sharir,et al.  Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes , 1986, FOCS.

[5]  E. Szemerédi.  On sets of integers containing no four elements in arithmetic progression , 1969 .

[6]  Zhenxiang Zhang.  On a Problem of Erdos Concerning Primitive Sequences , 1993 .

[7]  Neil Hindman,et al.  Finite Sums from Sequences Within Cells of a Partition of N , 1974, J. Comb. Theory, Ser. A.

[8]  Jean-Paul Allouche,et al.  A relative of the Thue-Morse sequence , 1995, Discret. Math..

[9]  G. Meinardus,et al.  Functional Equations Connected With The Collatz Problem , 1994 .

[10]  H. Davenport.  A combinatorial problem connected with differential equations II , 1971 .

[11]  A. K. Chandra.  On the Solution of Moser's Problem in Four Dimensions , 1973, Canadian Mathematical Bulletin.

[12]  Franz-Josef Brandenburg,et al.  Uniformly Growing k-TH Power-Free Homomorphisms , 1988, Theor. Comput. Sci..

[13]  Robert Cori,et al.  Partially Abelian squarefree words , 1990, RAIRO Theor. Informatics Appl..

[14]  W. H. Gottschalk,et al.  A characterization of the Morse minimal set , 1964 .

[15]  R. A. Rankin,et al.  XXIV.—Sets of Integers Containing not more than a Given Number of Terms in Arithmetical Progression , 1961, Proceedings of the Royal Society of Edinburgh. Section A. Mathematical and Physical Sciences.

[16]  Georg Hajós,et al.  Über einfache und mehrfache Bedeckung desn-dimensionalen Raumes mit einem Würfelgitter , 1942 .

[17]  Aviezri S. Fraenkel,et al.  Nonhomogeneous spectra of numbers , 1981, Discret. Math..

[18]  E. Heppner.  Eine Bemerkung zum Hasse-Syracuse-Algorithmus , 1978 .

[19]  George Mills.  A quintessential proof of van der Waerden's theorem on arithmetic progressions , 1983, Discret. Math..

[20]  Herve Lehning.  Computer-Aided or Analytic Proof? , 1990 .

[21]  Imre Z. Ruzsa,et al.  Generalized arithmetical progressions and sumsets , 1994 .

[22]  Paul Erdös,et al.  On a class of aperiodic sum-free sets , 1996 .

[23]  I. Krasikov.  HOW MANY NUMBERS SATISFY THE 3X + 1 CONJECTURE? , 1989 .

[24]  Lynn E. Garner.  On heights in the Collatz 3n + 1 problem , 1985, Discret. Math..

[25]  A. Street,et al.  Combinatorics: room squares, sum-free sets, Hadamard matrices , 1972 .

[26]  F. Michel Dekking,et al.  On Repetitions of Blocks in Binary Sequences , 1976, J. Comb. Theory, Ser. A.

[27]  N. Alon.  Independent sets in regular graphs and sum-free subsets of finite groups , 1991 .

[28]  Micha Sharir,et al.  Improved lower bounds on the length of Davenport-Schinzel sequences , 1988, Comb..

[29]  J. Spencer,et al.  On extremal density theorems for linear forms , 1977 .

[30]  Richard E. Crandall,et al.  On the $‘‘3x+1”$ problem , 1978 .

[31]  Neil Hindman.  Partitions and sums and products of integers , 1979 .

[32]  H. L. Abbott,et al.  Lower Bounds for Certain Types of van der Waerden Numbers , 1972, J. Comb. Theory, Ser. A.

[33]  Jeffrey C. Lagarias,et al.  The 3x + 1 Problem and its Generalizations , 1985 .

[34]  R. Salem,et al.  On Sets of Integers Which Contain No Three Terms in Arithmetical Progression. , 1942, Proceedings of the National Academy of Sciences of the United States of America.

[35]  Assaf J. Kfoury,et al.  A linear-time algorithm to decide whether a binary word contains an overlap , 1986, Bull. EATCS.

[36]  K. Matthews,et al.  A generalization of Hasse's generalization of the Syracuse algorithm , 1984 .

[37]  Paul Erdös,et al.  On sequences of positive integers , 1936 .

[38]  Jeffrey Shallit,et al.  On the maximum number of distinct factors of a binary string , 1993, Graphs Comb..

[39]  Tom C. Brown.  Behrend's Theorem for Sequences Containing No k-Element Arithmetic Progression of a Certain Type , 1975, J. Comb. Theory, Ser. A.

[40]  G. Venturini.  Iterates of Number Theoretic Functions with Periodic Rational Coefficients (Generalization of the 3x + 1 Problem) , 1992 .

[41]  G. Tenenbaum,et al.  On the set of divisors of an integer , 1984 .

[42]  Jeffrey C. Lagarias,et al.  Asymmetric Tent Map Expansions. I. Eventually Periodic Points , 1993 .

[43]  Ivan Korec.  A density estimate for the $3x+1$ problem , 1994 .

[44]  Karel A. Post,et al.  Some fascinating integer sequences , 1992, Discret. Math..

[45]  Earl Glen Whitehead.  The ramsey number N(3, 3, 3, 3; 2) , 1973, Discret. Math..

[46]  Günther Wirsching.  A Markov chain underlying the backward Syracuse algorithm , 1994 .

[47]  Micha Sharir,et al.  Almost linear upper bounds on the length of general davenport—schinzel sequences , 1987, Comb..

[48]  Jean Berstel,et al.  Some Recent Results on Squarefree Words , 1984, STACS.

[49]  Richard Rado,et al.  Arithmetic Properties of Certain Recursively Defined Sets. , 1974 .

[50]  H. Wilf,et al.  Uniqueness theorems for periodic functions , 1965 .

[51]  Jeffrey C. Lagarias,et al.  The Distribution of 3x+1 Trees , 1995, Exp. Math..

[52]  How many 3-term arithmetic progressions can there be if there are no longer ones , 1977 .

[53]  P. Erdös.  On the density of some sequences of integers , 1948 .

[54]  M. T. L. Bizley.  A Problem in Permutations , 1963 .

[55]  K. F. Roth.  Irregularities of sequences relative to arithmetic progressions, IV , 1972 .

[56]  H. Davenport,et al.  A Combinatorial Problem Connected with Differential Equations , 1965 .

[57]  Aviezri S. Fraenkel,et al.  A Linear Algorithm for Nonhomogeneous Spectra of Numbers , 1984, J. Algorithms.

[58]  Michael G. Main,et al.  An O(n log n) Algorithm for Finding All Repetitions in a String , 1984, J. Algorithms.

[59]  J. Justin.  Généralisation du Théorème de van der Waerden sur les Semi-groupes Répétitifs , 1972, J. Comb. Theory, Ser. A.

[60]  Helmut Prodinger,et al.  Infinite 0-1-sequences without long adjacent identical blocks , 1979, Discret. Math..

[61]  A. J. Kfoury.  Square-free and overlap-free words , 1988 .

[62]  Péter Komjáth,et al.  A simplified construction of nonlinear Davenport-Schinzel sequences , 1988, J. Comb. Theory, Ser. A.

[63]  On sum-free subsequences , 1975 .

[64]  P. Erdös,et al.  On the Irrationality of Certain Ahmes Series , 1963 .

[65]  S. Brocco.  A Note On Mignosi′s Generalization of the (3X+1)-Problem , 1995 .

[66]  Shalom Eliahou,et al.  The 3x+1 problem: new lower bounds on nontrivial cycle lengths , 1993, Discret. Math..

[67]  A. Besicovitch,et al.  On the density of certain sequences of integers , 1935 .

[68]  Zoltán Szabó.  An Application of Lovász's Local Lemma - A New Lower Bound for the van der Waerden Number , 1990, Random Struct. Algorithms.

[69]  Richard Mollin,et al.  On the Number of Sets of Integers With Various Properties , 1990 .

[70]  R. Terras,et al.  A stopping time problem on the positive integers , 1976 .

[71]  Bruce M. Landman.  An upper bound for van der Waerden-like numbers usingk colors , 1993, Graphs Comb..

[72]  N. Alon,et al.  A Tribute to Paul Erdős: Sum-free subsets , 1990 .

[73]  Stephen M. Tanny,et al.  A well-behaved cousin of the Hofstadter sequence , 1992, Discret. Math..

[74]  R. Mullin,et al.  A map-theoretic approach to Davenport-Schinzel sequences. , 1972 .

[75]  Neil Hindman.  Partitions and Sums and Products - Two Counterexamples , 1980, J. Comb. Theory, Ser. A.

[76]  Lynn E. Garner.  On the Collatz $3n+1$ algorithm , 1981 .

[77]  Walter Deuber.  Partitionen und lineare Gleichungssysteme , 1973 .

[78]  Daniel A. Rawsthorne.  Imitation of an Iteration , 1985 .

[79]  A ₂-sequence with larger reciprocal sum , 1993 .

[80]  J. H. Conway.  The Weird and Wonderful Chemistry of Audioactive Decay , 1987 .

[81]  Albrecht Beutelspacher,et al.  Generalized SCHUR numbers , 1982 .

[82]  H. L. Abbott,et al.  A problem of Schur and its generalizations , 1972 .

[83]  Julien Cassaigne,et al.  Counting Overlap-Free Binary Words , 1993, STACS.

[84]  Neil J. A. Sloane,et al.  An On-Line Version of the Encyclopedia of Integer Sequences , 1994 .

[85]  J. Bourgain.  A Tribute to Paul Erdős: On arithmetic progressions in sums of sets of integers , 1990 .

[86]  Neil J. Calkin.  On the Number of Sum-Free Sets , 1990 .

[87]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[88]  Jean-Jacques Pansiot.  A propos d'une conjecture de F. Dejean sur les répétitions dans les mots , 1984, Discret. Appl. Math..

[89]  Andrzej Ehrenfeucht,et al.  Repetitions in Homomorphisms and Languages , 1982, ICALP.

[90]  Xingde Jia.  On B2k-Sequences , 1994 .

[91]  On sets of integers not containing arithmetic progressions of prescribed length , 1974 .

[92]  Richard J. Lorentz,et al.  Linear Time Recognition of Squarefree Strings , 1985 .

[93]  Walter S. Sizer.  Mathematical notions in preliterate societies , 1991 .

[94]  Are 0-Additive Sequences Always Regular? , 1992 .

[95]  E. Berlekamp,et al.  Winning Ways for Your Mathematical Plays , 1983 .

[96]  Ernst Witt.  Ein kombinatorischer Satz der Elementargeometrie , 1952 .

[97]  Jr. Hall,et al.  Cyclic projective planes , 1947 .

[98]  J. Leech.  2726. A problem on strings of beads , 1957, Mathematical Gazette.

[99]  A. Hales,et al.  Regularity and Positional Games , 1963 .

[100]  John R. Rabung.  Some Progression-Free Partitions Constructed using Folkman's Method , 1979, Canadian Mathematical Bulletin.

[101]  T. D. Parsons,et al.  On Monotone Subsequences , 1988 .

[102]  Paul Erdös,et al.  Some applications of graph theory to number theory , 1969 .

[103]  R. C. ENTRINGER,et al.  On Nonrepetitive Sequences , 1974, J. Comb. Theory, Ser. A.

[104]  F. Behrend.  On Sets of Integers Which Contain No Three Terms in Arithmetical Progression. , 1946, Proceedings of the National Academy of Sciences of the United States of America.

[105]  On a problem of Erdős concerning primitive sequences , 1993 .

[106]  Solomon W. Golomb,et al.  On Certain Nonlinear Recurring Sequences , 1963 .

[107]  E.R. Berlekamp.  A Construction for Partitions Which Avoid Long Arithmetic Progressions , 1968, Canadian Mathematical Bulletin.

[108]  Michael D. Beeler,et al.  Some new Van der Waerden numbers , 1979, Discret. Math..

[109]  Jeffrey C. Lagarias,et al.  THE 3x + 1 PROBLEM: TWO STOCHASTIC MODELS , 1992 .

[110]  R. Rado.  Note on Combinatorial Analysis , 1945 .

[111]  Patrice Séébold,et al.  Overlap-free sequences , 1984, Automata on Infinite Words.

[112]  C. V. Eynden,et al.  Any arithmetic progressions covering the first 2ⁿ integers cover all integers , 1970 .

[113]  On a conjecture of Erdős on the sum ∑p ⩽ n 1(p log p) , 1991 .

[114]  Micha Sharir,et al.  Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences , 2015, J. Comb. Theory, Ser. A.

[115]  E. Szemerédi.  On sets of integers containing k elements in arithmetic progression , 1975 .

[116]  Filippo Mignosi,et al.  Repetitions in the Fibonacci infinite word , 1992, RAIRO Theor. Informatics Appl..

[117]  Endre Szemerédi,et al.  Linear problems in combinatorial number theory , 1975 .

[118]  O. Dunkel,et al.  Problems for Solutions: 3173-3180 , 1926 .

[119]  H. Müller.  Über eine klasse 2-adischer funktionen im zusammenhang mit dem „3X + 1“-problem , 1994 .

[121]  P. Erdös.  Note on Sequences of Integers No One of Which is Divisible By Any Other , 1935 .

[122]  L. Dickson.  The converse of Waring’s problem , 1934 .

[123]  P. Erdös,et al.  Combinatorial Theorems on Classifications of Subsets of a Given Set , 1952 .

[124]  Tom C. Brown,et al.  Is There a Sequence on Four Symbols in Which No Two Adjacent Segments are Permutations of One Another , 1971 .

[125]  Carl Pomerance.  Collinear Subsets of Lattice Point Sequences - An Analog of Szemerédi's Theorem , 1980, J. Comb. Theory, Ser. A.

[126]  E. Szemerédi.  On a problem of Davenport and Schinzel , 1974 .

[127]  S. Znám,et al.  A Note on the 3x + 1 Problem , 1987 .

[128]  K. A. Baker,et al.  Growth Problems for Avoidable Words , 1989, Theor. Comput. Sci..

[129]  K. Matthews,et al.  A Markov approach to the generalized Syracuse algorithm , 1985 .

[130]  Zoltán Füredi,et al.  Davenport-Schinzel theory of matrices , 1992, Discret. Math..

[131]  Richard Mollin,et al.  On Partitions of the Positive Integers With No x, y, z Belonging to Distinct Classes Satisfying x + y = z , 1990 .

[132]  L. Thomas Ramsey,et al.  Sets of Integers With No Long Arithmetic Progressions Generated by the Greedy Algorithm , 1979 .

[133]  A. Stöhr,et al.  Gelöste und ungelöste Fragen über Basen der natürlichen Zahlenreihe. II. , 1955 .

[134]  Peter Alles.  On a Conjecture of J. Pelikán , 1992, J. Comb. Theory, Ser. A.

[135]  Harold Fredricksen.  Schur Numbers and the Ramsey Numbers N(3, 3, ..., 3; 2) , 1979, J. Comb. Theory, Ser. A.

[136]  Danièle Gardy,et al.  Enumerating Davenport-Schinzel sequences , 1992, RAIRO Theor. Informatics Appl..

[137]  M. Kac,et al.  A history-dependent random sequence defined by Ulam , 1989 .

[138]  T. Coquand.  A constructive topological proof of van der Waerden's theorem , 1995 .

[139]  K. F Roth.  Irregularities of sequences relative to arithmetic progressions, III , 1970 .

[140]  The irrationality of certain infinite series , 1987 .

[141]  Nicholas F. J. Inglis,et al.  Very Odd Sequences , 1995, J. Comb. Theory, Ser. A.

[142]  Upper bound of $\sum 1/(a\sb i\log a\sb i)$ for primitive sequences , 1993 .

[143]  C. J. Everett.  Iteration of the number-theoretic function f(2n) = n, f(2n + 1) = 3n + 2 , 1977 .

[144]  V. Chvatal,et al.  Remarks on a Problem of Moser , 1972, Canadian Mathematical Bulletin.

[145]  J. Lagarias.  The set of rational cycles for the 3x+1 problem , 1990 .

[146]  Zhenxiang Zhang.  Finding finite B 2 -sequences with large m-a 1/2 m , 1994 .

[147]  H. E. Robbins.  On a class of recurrent sequences , 1937 .

[148]  R. Robinson.  Periodicity of Somos sequences , 1992 .

[149]  Yuji Kobayashi,et al.  Repetition-Free Words , 1986, Theor. Comput. Sci..

[150]  G. A. Hedlund,et al.  Unending chess, symbolic dynamics and a problem in semigroups , 1944 .

[151]  R. Stanton,et al.  Some properties of Davenport-Schinzel sequences , 1971 .

[152]  H. Abbott,et al.  Sum-free sets of integers , 1966 .

[153]  D. Boyd.  Which Rationals are Ratios of Pisot Sequences? , 1985, Canadian Mathematical Bulletin.

[154]  F. Michel Dekking,et al.  Strongly Non-Repetitive Sequences and Progression-Free Sets , 1979, J. Comb. Theory, Ser. A.

[155]  Françoise Dejean,et al.  Sur un Théorème de Thue , 1972, J. Comb. Theory A.

[156]  Richard A. Dean.  A Sequence Without Repeats on x, x -1 , y, y -1 , 1965 .

[157]  Robert W. Irving.  An extension of Schur's theorem on sum-free partitions , 1973 .

[158]  H. Möller.  Über Hasses Verallgemeinerung des Syracuse-Algorithmus (Kakutanis Problem) , 1978 .

[159]  P. Pleasants.  Non-repetitive sequences , 1970, Mathematical Proceedings of the Cambridge Philosophical Society.

[160]  Dwight R. Bean,et al.  Avoidable patterns in strings of symbols , 1979 .

[161]  K. Wiertelak.  On the density of some sets of primes, II , 1978 .

[162]  E. Fukada,et al.  Inverse piezoelectric effect and electrostrictive effect in polarized poly(vinylidene fluoride) films , 1975 .

[163]  E. Levine,et al.  An upper estimate for the reciprocal sum of a sum-free sequence , 1977 .

[164]  Mac Mahon's Prime Numbers of Measurement , 1975 .

[165]  Jeffrey Shallit,et al.  The "3x + 1" Problem and Finite Automata , 1992, Bull. EATCS.

[166]  Sum-Free Sets , 1972 .

[167]  P. A. B. Pleasants,et al.  Characterization of two-distance sequences , 1992 .

[168]  David Haussler,et al.  Applications of an Infinite Square-Free CO-CFL , 1987, Theor. Comput. Sci..

[169]  J Justin.  Characterization of the repetitive commutative semigroups , 1972 .

[170]  Maxime Crochemore,et al.  Sharp Characterizations of Squarefree Morphisms , 1982, Theor. Comput. Sci..

[171]  Richard Rado,et al.  Linear Combinations of Sets of Consecutive Integers. , 1973 .

[172]  F. Mignosi.  On a Generalization of the 3x + 1 Problem , 1995 .

[173]  Ronald L. Graham,et al.  A short proof of van der Waerden’s theorem on arithmetic progressions , 1974 .

[174]  La démonstration de furstenberg du théorème de szemerédi sur les progressions arithmétiques , 1979 .

[175]  Cayley.  1. On a Problem of Arrangements , 1878 .

[176]  Walter A. Deuber.  On van der Waerden's Theorem on Arithmetic Progressions , 1982, J. Comb. Theory, Ser. A.

[177]  Patrice Séébold.  Complément A L'étude des Suites de Thue-Morse Généralisées , 1986, RAIRO Theor. Informatics Appl..

[178]  Paul Erdös,et al.  On Some Sequences of Integers , 1936 .

[179]  J. Riddell,et al.  A Lattice Point Problem Related to Sets Containing No l-Term Arithmetic Progression , 1971, Canadian Mathematical Bulletin.

[180]  Aviezri S. Fraenkel,et al.  How Many Squares Must a Binary Sequence Contain? , 1997, Electron. J. Comb..

[181]  Ronald L. Graham,et al.  On permutations containing no long arithmetic progressions , 1977 .

[182]  Leo Moser.  Notes on Number Theory II : On a theorem of van der Waerden , 1960, Canadian Mathematical Bulletin.

[183]  I. Korec.  The $3x+1$ problem, generalized Pascal triangles and cellular automata , 1992 .

[184]  Counting Sets of Integers, Nokof Which Sum to Another , 1995 .

[185]  John Rabung.  On Applications of Van Der Waerden's Theorem , 1975 .

[186]  K. Mahler,et al.  An unsolved problem on the powers of 3/2 , 1968, Journal of the Australian Mathematical Society.

[187]  H. L. Abbott,et al.  On Partitioning Integers into Progression Free Sets , 1972, J. Comb. Theory, Ser. A.

[188]  Colin L. Mallows,et al.  Conway's challenge sequence , 1991 .

[189]  S. W. Golomb.  Influence of data processing on the design and communication of experiments , 1964 .

[190]  Guo-Gang Gao.  On consecutive numbers of the same height in the Collatz problem , 1993, Discret. Math..

[191]  Leo Moser,et al.  On Non-Averaging Sets of Integers , 1953, Canadian Journal of Mathematics.

[192]  J. Sander.  On the (3N+1)-conjecture , 1990 .

[193]  A uniqueness theorem for a generalized solution of a system of two quasilinear equations in the class of bounded, measurable functions , 1978 .

[194]  H. N. Shapiro,et al.  An arithmetic property of certain rational powers , 1967 .

[196]  Michel Leconte,et al.  K-th power free codes , 1984, Automata on Infinite Words.

[197]  Imre Z. Ruzsa.  On the number of sums and differences , 1992 .

[198]  Serge Burckel.  Functional Equations Associated with Congruential Functions , 1994, Theor. Comput. Sci..

[199]  Ursula Schmidt,et al.  Avoidable Patterns on Two Letters , 1989, Theor. Comput. Sci..

[200]  Veikko Keränen.  On the k-Freeness of Morphisms on Free Monoids , 1987, STACS.

[201]  András Sárközy,et al.  On a Conjecture of Roth and Some Related Problems I , 1989 .

[202]  H. Furstenberg.  Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions , 1977 .

[203]  Janice L. Malouf.  An integer sequence from a rational recursion , 1992, Discret. Math..

[204]  A. Khinchin.  Three Pearls of Number Theory , 1952 .

[205]  Saharon Shelah,et al.  Primitive recursive bounds for van der Waerden numbers , 1988 .

[206]  Juhani Karhumäki,et al.  On cube-free ω-words generated by binary morphisms , 1983, Discret. Appl. Math..

[207]  Maxime Crochemore,et al.  An Optimal Test on Finite Unavoidable Sets of Words , 1983, Inf. Process. Lett..

[208]  G. Wirsching.  An improved estimate concerning 3n+1 predecessor sets , 1993 .

[209]  Jamie Simpson,et al.  Greedily partitioning the natural numbers into sets free of arithmetic progressions , 1988 .

[210]  W. A. Beyer,et al.  COMPUTER STUDIES OF SOME HISTORY-DEPENDENT RANDOM PROCESSES. , 1969 .

[211]  K. F. Roth.  On Certain Sets of Integers , 1953 .

[212]  R. S. Stevens,et al.  Computer-generated van der Waerden partitions , 1978 .

[213]  Veikko Keränen,et al.  On k-Repetition Free Words Generated by Length Uniform Morphisms Over a Binary Alphabet , 1985, ICALP.

[214]  Two combinatorial theorems on arithmetic progressions , 1962 .

[215]  Ronald L. Graham,et al.  Spectra of Numbers , 1978 .

[216]  Noga Alon,et al.  Adding Distinct Congruence Classes Modulo a Prime , 1995 .

[217]  Bruce M. Landman,et al.  Some new bounds and values for van der Waerden-like numbers , 1990, Graphs Comb..

[218]  Neil J. A. Sloane,et al.  The encyclopedia of integer sequences , 1995 .

[219]  B. Fein,et al.  On the representation of−1 as a sum of two squares in an algebraic number field , 1971 .

[220]  Carl Pomerance,et al.  On a conjecture of Crandall concerning the qx + 1 problem , 1995 .

[221]  H. Shyr.  A strongly primitive word of arbitrary length and its application , 1977 .

[222]  Dj Daniel Bernstein,et al.  A non-iterative 2-adic statement of the 3N+1 conjecture , 1994 .

[223]  Antonio Restivo,et al.  Overlap-free words on two symbols , 1984, Automata on Infinite Words.

[224]  Periodicities of solutions of the generalized lyness recursion , 1995 .

[225]  Michael G. Main,et al.  An Infinite Square-Free co-CFL , 1985, Inf. Process. Lett..

[226]  A. Street,et al.  Maximal Sum-Free Sets in Elementary Abelian p-Groups , 1971, Canadian Mathematical Bulletin.

[227]  R. Rado,et al.  Studien zur Kombinatorik , 1933 .

[228]  Joseph A. Gallian.  Circuits in directed grids , 1991 .

[229]  N. Sloane.  A Handbook Of Integer Sequences , 1973 .

[230]  Leo Moser,et al.  Inverse and Complementary Sequences of Natural Numbers , 1954 .