A091389 Aronson's mod 15 sequence: "T is the first, fourth, eleventh, first, ... letter in this sentence, not counting spaces and commas and all mod 15".

1, 4, 11, 1, 9, 0, 4, 10, 1, 3, 6, 12, 13, 6, 8, 13, 0, 4, 8, 13, 4, 6, 10, 14, 5, 11, 2, 4, 8, 12, 3, 8, 10, 13, 4, 8, 13, 6, 3, 9, 11, 1, 3, 12, 14, 2, 4, 8, 12, 3, 9, 11, 0, 4, 9, 11, 4, 12, 3, 4, 9, 14, 5, 9, 6, 12, 14, 4, 6, 14, 7, 13, 4, 9, 2, 8, 10, 0, 2, 11, 1, 7, 11, 1, 6, 11, 13, 3, 9, 13

Offset

0,2

Comments

Infinite? Periodic? It seems the answers are "Yes and No" because many numbers (such as "tenth") have multiple T's and moreover, in many of these, the T's are spread such that at least one of them will be != 2 mod 15 (2 is important because "second" is the only T-less word)

References

A. J. Aronson, quoted by D. R. Hofstadter in Metamagical Themas, Basic Books, NY, 1985, p. 44.

Links

Table of n, a(n) for n=0..89.

B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, J. Integer Seqs., Vol. 6 (2003), #03.2.2.

Crossrefs

Cf. A005224, A091387, A091388, A091390, A091391.

Sequence in context: A321967 A230024 A132150 * A175668 A113249 A087171

Adjacent sequences: A091386 A091387 A091388 * A091390 A091391 A091392

Keyword

easy,nonn,word

Author

Sam Alexander, Jan 05 2004

Status

approved