Studies on the Pea Pattern Sequence

2017/08/22 by André Pedroso Kowacs, Kowacs, Andre · 2 citations
Computer Science · #00A08 #Algorithms and Data Compression #Cellular Automata and Applications #FOS: Mathematics #History and Overview (math.HO) #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1708.06452

openalex publication_date 2017/08/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper we formally define the family of sequences know as "Pea Pattern". We then analyse its behaviour and conditions for fixed and periodic points. The paper ends with a list of fixed points and cycles.

Cited by

• Inventory Loops (i.e. Counting Sequences) have Pre-period 2max S₁+60
• The Look-and-Say The Biggest Sequence Eventually Cycles

Related

• The Peano curve and counting occurrences of some patterns
• Pattern Matching in the Cycle Structure of Permutations
• Sequences: Polynomial, C-finite, Holonomic, ...
• Pattern-avoiding modified ascent sequences
• Evolution patterns in Collatz problem