Partitioning the positive integers with higher order recurrences
Associated with any irrational number α>1 and the function g(n)=[αn+12] is an array {s(i,j)} of positive integers defined inductively as follows: s(1,1)=1, s(1,j)=g(s(1,j−1)) for all j≥2, s(i,1)= the least positive integer not among s(h,j) for h≤i−1 for i≥2, and s(i,j)=g(s(i,j−1)) for j≥2. This w...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1991-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171291000625 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|