NEW FAMILY OF SEQUENCES

THE GENERATION OF NEW SEQUENCES (Part E)

Introduction

Recently a new method for the generation of squares of squares were produced in Part IA through Part IVE. In addition, a new interleaved sequence of numbers was developed from this work and the sequence awarded the Sloane number A178218. OEIS has also published four other numbers based on this particular type of sequence. These numbers are A214345, A214493, A214393 and A214405.

This site will show two other sequences are generated from the square sequence method developed in Part IA and ending with Part IVE .

Some Background

The previous parts showed that a tuple (a₁,b₁,c₁) can be converted into a different tuple (a,b,c) basically a transformation of the type (a₁,b₁,c₁) ⇒ (a,b,c). In addition, the initial tuples start out with the tuples (1,b₁,1) or (1,1,c₁) in which the b₁s and the c₁s have the following values:

where k is any natural integer from 1 to ∞ used in calculating f and the denominator d = 2(2b₁ − c₁ − 1 ) in the equation:

This equation is critical is that it is the initial starting point for generating the interleaved sequences.

Table and General Sequence

The tables listed below although produced according to the methods of Parts IA through IVE, were actually computed and outputted by a computer program. Three sequences are apparent as highlighted in color. The one in green, and the one in white. For example each green tuple ends with a number which is repeated in the next green tuple. Likewise for the white tuples. Initially the tables was constructed using the initial tuple (1,1,-19).

Separation of Sequences

To separate out the two sequences and generate the equations for each, the following method was found. All we need are two equations to generate the interleaved sequences in this case we wil take a and b. Since two sequences may be produced from table II above, a factor f_s = 2 will be used to convert a ⇒ new a and b ⇒ new b. This is accomplished by substituting the value of 2n for n in the equations for a and b, to give the equations for the first sequence:

Using these equations (or copying directly from Table II) we obtain for the first sequence whose Sloane number is listed in oeis as A216875:

10, 10, -10, 10, 10, 50, 70, 130, 170, 250, 310, 410, 490, 610, 710, 850, 970, 1130, 1270, 1450, 1610, 1810, 1990, 2210, 2410, 2650, 2870, 3130, 3370, 3650, 3910, 4210, 4490, 4810, 5110, 5450, 5770, 6130, 6470, 6850, 7210, 7610, 7990, 8410, 8810, 9250, 9670

In addition, when each entry is divided by 10 the sequence is identical to the Sloane number A178218:
1, 1, -1, 1, 1, 5, 7, 13, 17, 25, 31, 41, 49, 61, 71, 85, 97, 113, 127, 145, 161, 181, 199, 221, 241, 265, 287, 313, 337, 365, 391, 421, 449, 481, 511, 545, 577, 613, 647, 685, 721, 761, 799, 841, 881, 925, 967, 1013

To obtain the equations for the second sequence we use the second line of table II (1,11,1) and solve for f.

Substituting the value of 2n for n in the equations for a and b as was done above, affords the equations for the second sequence:

Using these equations (or copying directly from Table II) we obtain for the second sequence whose Sloane number is listed in oeis as A216876:

-5, 5, -5, 25, 35, 85, 115, 185, 235, 325, 395, 505, 595, 725, 835, 985, 1115, 1285, 1435, 1625, 1795, 2005, 2195, 2425, 2635, 2885, 3115, 3385, 3635, 3925, 4195

In addition, when each entry is divided by 5 the sequence is identical to the Sloane number A214345:
5, 7, 17, 23, 37, 47, 65, 79, 101, 119, 145, 167, 197, 223, 257, 287, 325, 359, 401, 439, 485, 527, 577, 623, 677, 727, 785, 839

So in effect what we have done is to produce two new interleaved sequences via a completely new route. Any other way would probably have generated one sequence without the knowledge that others exist. In addition, both sequences are related via the general sequence formula (before factoring in f_s) and thus constitute a family of interleaved sequences.

This concludes Part E. Go back to homepage.