Numerical Analogues of Aronson's Sequence

Details Numerical Analogues of Aronson's Sequence Numerical Analogues of Aronson's Sequence

2003-05-21

arxiv.org/abs/math/0305308v1

Mathematics

Number Theory

16 pages

Scientific paper

Aronson's sequence 1, 4, 11, 16, ... is defined by the English sentence ``t is the first, fourth, eleventh, sixteenth, ... letter of this sentence.'' This paper introduces some numerical analogues, such as: a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition ``n is a member of the sequence if and only if a(n) is odd.'' This sequence can also be characterized by its ``square'', the sequence a^(2)(n) = a(a(n)), which equals 2n+3 for n >= 1. There are many generalizations of this sequence, some of which are new, while others throw new light on previously known sequences.

Affiliated with

Also associated with

No associations

Rating

Numerical Analogues of Aronson's Sequence does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Numerical Analogues of Aronson's Sequence, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Numerical Analogues of Aronson's Sequence will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-41268