Another variation on Conway's recursive sequence

DOI10.1016/j.disc.2003.10.022zbMath1042.05004OpenAlexW2060510618MaRDI QIDQ1827740

Jarosław Grytczuk

Publication date: 6 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.10.022

zbMATH Keywords

Pascal triangleConway's recursive sequenceguided sparse substitutionstrange recurrence

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Recurrences (11B37) Special sequences and polynomials (11B83)

Related Items (2)

Spot-Based Generations for Meta-Fibonacci Sequences ⋮ Constructing New Families of Nested Recursions with Slow Solutions

Uses Software

• OEIS

Cites Work

• Language-theoretic problems arising from Richelieu cryptosystems
• The error term in Golomb's sequence
• A well-behaved cousin of the Hofstadter sequence
• Infinite self-similar words
• On a functional-differential equation related to Golomb's self-described sequence
• On Golomb's self describing sequence. II
• On Golomb's self describing sequence
• Intertwined infinite binary words
• On Conway's recursive sequence
• Conway's Challenge Sequence
• A Chaotic Cousin of Conway's Recursive Sequence
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Another variation on Conway's recursive sequence