OFFSET
1,3
COMMENTS
Here multiplication denotes concatenation of strings. This is Gijswijt's sequence, A090822, except that the 'y' blocks count as being equivalent whenever the sum of their digits is equal.
LINKS
Rémy Sigrist, Table of n, a(n) for n = 1..10000
F. J. van de Bult, D. C. Gijswijt, J. P. Linderman, N. J. A. Sloane and Allan Wilks, A Slow-Growing Sequence Defined by an Unusual Recurrence, J. Integer Sequences, Vol. 10 (2007), #07.1.2.
F. J. van de Bult, D. C. Gijswijt, J. P. Linderman, N. J. A. Sloane and Allan Wilks, A Slow-Growing Sequence Defined by an Unusual Recurrence [pdf, ps].
Rémy Sigrist, C program
EXAMPLE
From Rémy Sigrist, Feb 08 2023: (Start)
The first terms, alongside an appropriate partition of prior terms, are:
n a(n) Prior terms
-- ---- -----------------
1 1 N/A
2 1 1
3 2 1|1
4 2 1 1|2
5 3 1 1|2|2
6 1 1 1 2 2 3
7 2 1 1|2 2|3 1
8 2 1 1 2 2|3 1 2
9 3 1 1|2 2|3 1|2 2
10 2 1|1 2 2 3|1 2 2 3
(End)
PROG
(C) See Links section.
CROSSREFS
KEYWORD
nonn
AUTHOR
J. Taylor (integersfan(AT)yahoo.com), Mar 17 2004
STATUS
approved