Jim Sauerberg

  • Citations Per Year
Learn More
In general, given any finite sequence of positive numbers S0, this process of constructing Si+1 to be the sequence that counts how many times each number in Si appears in Si creates a counting sequence {Si}i≥0. As the reader certainly noticed, in our counting sequence we have S5 = S6 = S7 = · · · . In fact, in any counting sequence, because Si+1 is uniquely(More)
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you(More)
  • 1