It's easy to miss. The square numbers are 1, 4, 9, 16, 25, 36, 49 and so on but it's not obvious that the consecutive integers 27423, 27424 and 27425 are divisible by consecutive square numbers. Thus we have:
A178919 | Smallest of three consecutive integers divisible respectively by three consecutive squares greater than 1. |
Membership of this sequence does not come easy and can be seen in the list of its initial members (permalink):
2223, 5823, 9423, 13023, 16623, 20223, 23823, 27423, 31023, 32975, 34623, 38223, 41823, 45423, 49023, 52623, 56223, 59823, 63423, 67023, 70623, 74223, 77075, 77823, 81423, 85023, 88623, 92223, 95823, 99423, 103023, 106623, 110223
Not surprisingly membership in the equivalent sequence of two consecutive integers divisible by two consecutive squares is a lot easier. This sequence is OEIS A178918. The natural question to ask is whether there are groups of four consecutive integers divisible by four consecutive squares. Testing up in the range up to ten million, we find no such groups. However, they may well exist further out.
What about cubes? Can we find groups of three consecutive integers that are divisible by three consecutive cubes greater than 1. Indeed we can and, up one million, the sequence of the smallest members of these trios is (permalink):
106623, 322623, 538623, 754623, 970623 (not listed in the OEIS)
Let's look at the first member of the sequence where we find: What's interesting about sequences like this is that the numbers derive their membership via the groups to which they belong. For convenience, as in the case of OEIS A178919, only the first number in the group is listed. It is the relationship between the numbers in the group that are important. In the case of OEIS A178919 the numbers form a group of three that are consecutive and divisible by consecutive squares. Thus we have in the case of 27423: or in the case of 106623: It would be interesting to explore divisibility using criteria other than divisibility by consecutive squares or cubes. What about divisibility of three consecutive integers by three consecutive fibonacci numbers (0, 1, 1, 2, 3, 5, 8, ...)? Well, if we ignore 0 and 1 and start with 2, it turns out that a great many groups of three qualify, most of which are divisible by 2, 3 and 5. The first of these begins with 8: There are 4417 such groups of three in the range up to 100,000, so they are very common. If we exclude 2, 3 and 5 and begin instead with 8, then the groupings of three become far less common (only 60 in the range up 100,000). The first of these begins with 376 (permalink): This is clearly a topic worthy of further research.
No comments:
Post a Comment