My Favorite Integer Sequences
نویسنده
چکیده
This paper gives a brief description of the author’s database of integer sequences, now over 35 years old, together with a selection of a few of the most interesting sequences in the table. Many unsolved problems are mentioned. This paper was published (in a somewhat different form) in Sequences and their Applications (Proceedings of SETA ’98), C. Ding, T. Helleseth and H. Niederreiter (editors), Springer-Verlag, London, 1999, pp. 103130. Enhanced pdf version prepared Apr 28, 2000. The paragraph on “Sorting by prefix reversal” on page 7 was revised Jan. 17, 2001. The paragraph on page 6 concerning sequence A1676 was corrected on Aug 02, 2002.
منابع مشابه
Michael Tsapatsis.
Looking back over my career, I ... am hopeful, based on the progress achieved so far, that molecular sieve films will become a widespread energy-efficient separation technology. I am waiting for the day when someone will discover ... the “aeik nhton” (perpetual motion machine). The biggest challenge facing scientists is ... to ensure the peaceful use of their discoveries. My first experiment wa...
متن کاملChallenges of Symbolic Computation: My Favorite Open Problems
The success of the symbolic mathematical computation discipline is striking. The theoretical advances have been continuous and significant: Gröbner bases, the Risch integration algorithm, integer lattice basis reduction, hypergeometric summation algorithms, etc. From the beginning in the early 60s, it has been the tradition of our discipline to create software that makes our ideas readily avail...
متن کاملNon-Abelian Sequenceable Groups Involving ?-Covers
A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...
متن کاملSummary of Research Accomplishments and Goals
My Ph.D. thesis centered on a class of univariate polynomials over finite fields known as composed products or root-based compositions . Work related to the thesis appears in [5], [6], and [41], while additional results pertaining to multivariate analogues appear in [48] and [49]. My post-thesis research in finite fields includes not only work with polynomials (see [14] and [44]), but also work...
متن کاملChallenges of Symbolic Computation
The success of the symbolic mathematical computation discipline is striking. The theoretical advances have been continuous and significant: Gröbner bases, the Risch integration algorithm, integer lattice basis reduction, hypergeometric summation algorithms, etc. From the beginning in the early 1960s, it has been the tradition of our discipline to create software that makes our ideas readily ava...
متن کامل