NEW FAMILY OF SEQUENCES

THE GENERATION OF NEW SEQUENCES (Part C)

Picture of a square

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 that these four sequences as well as an infinitude of others 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 (a1,b1,c1) can be converted into a different tuple (a,b,c) basically a transformation of the type (a1,b1,c1) ⇒ (a,b,c). In addition, the initial tuples start out with the tuples (1,b1,1) or (1,1,c1) in which the b1s and the c1s have the following values:

b1 =  k
b1 = −k
c1 =  k
c1 = −k

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

f = [2e2n2 + (4c1 − 4b1) en +(1 − 2b12 + c12)] / {2(2b1 − c1 − 1)}

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. Four sequences are apparent as highlighted in color. The one in green, the one in teal, the one in pink 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 teal, the pink and white tuples.

  
n
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
Table I
a1 b1 c1
11-15
15-7
191
1139
11717
12125
12533
12941
13349
13757
14165
14573
14981
15389
15797
161105
  
f = S/d
7
0
-5
-8
-9
-8
-5
0
7
16
27
40
55
72
91
112
Table II
a b c
88-8
15-7
-44-4
-751
-888
-71317
-42028
12941
84056
175373
286892
4185113
56104136
73125161
92148188
113173217
  
Δ
0
24
0
-24
0
120
384
840
1536
2520
3840
5544
7680
10296
13440
17160
For the tuple (1,1, −15)   f is calculated to be:
f = [2e2n2 + (− 60 − 4)en + 224]/2×16 = [2e2n2 − 64en + 288]/32
Setting e = 4 and g = 8 affords f = n2 − 8n + 7
Substituting this value of f in
(f + 1, f + 4n + 1, f + 8n − 15) as was shown in Part IA
gives the general equations for the complete sequence

a = (n2 − 8n + 7 + 1 ) = (n2 − 8n + 8 )
b = (n2 − 8n + 7 + 4n + 1 ) = (n2 − 4n + 8)
c = (n2 − 8n + 7 + 8n − 15 ) = (n2 − 8)

Separation of Sequences

To separate out the four 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 fs = 4 will be used to convert a ⇒ new a and b ⇒ new b. This is accomplished by substituting the value of 4n for n in the equations for a and b, to give the equations for the first sequence:

a = (16n2 − 32n + 8 )
b = (16n2 − 16n + 8)

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

8, 8, -8, 8, 8, 40, 56, 104, 136, 200, 248, 328, 392, 488, 568, 680, 776, 904, 1016, 1160, 1288, 1448, 1592, 1768, 1928, 2120, 2296, 2504, 2696, 2920, 3128, 3368, 3592, 3848, 4088, 4360, 4616, 4904, 5176, 5480, 5768, 6088, 6392, 6728, 7048, 7400, 7736, 8104, 8456, 8840, 9208, 9608, 9992, 10408, 10808, 11240, 11656

In addition, when each entry is divided by 8 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,5,-7) and solve for f.

For the tuple (1,5,-7)   f is calculated to be:
f = [2e2n2 + (−28 − 20)en + 0]/2×16 = [2e2n2 − 48en]/32
and by setting e = 4 affords the general equation f = n2 − 6n
Substituting this value of f in
(f + 1, f + 4n + 7, f + 8n − 5) as was shown in Part IA
gives the general equations for the complete sequence starting at point (1,5,-7)

a = (n2 − 6n + 1 ) = (n2 − 8n + 1 )
b = (n2 − 6n + 4n + 5 ) = (n2 − 2n + 5)
c = (n2 − 6n + 8n − 7) = (n2 + 2n − 7)

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

a = (16n2 − 24n + 1 )
b = (16n2 − 8n + 5)

Using these equations (or copying directly from Table II) we obtain for the second sequence identical to the Sloane No. A214393 except for the first three numbers which are also part of the sequence:

1, 5, -7, 13, 17, 53, 73, 125, 161, 229, 281, 365, 433, 533, 617, 733, 833, 965, 1081, 1229, 1361, 1525, 1673, 1853, 2017

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

For the tuple (1,9,1)   f is calculated to be:
f = [2e2n2 + (4 − 36)en − 160]/2×16 = [2e2n2 − 128en − 160]/32
and by setting e = 4 affords the general equation f = n2 − 4n − 5
Substituting this value of f in
(f + 1, f + 4n + 9, f + 8n + 1) as was shown in Part IA
gives the general equations for the complete sequence starting at point (1,9,1)

a = (n2 − 4n − 5 + 1 ) = (n2 − 4n − 4 )
b = (n2 − 4n − 5 + 4n + 9 ) = (n2 + 4)
c = (n2 − 4n − 5 + 8n + 1) = (n2 + 4n − 4)

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

a = (16n2 − 16n − 4 )
b = (16n2 + 4)

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

-4, 4, -4, 20, 28, 68, 92, 148, 188, 260, 316, 404, 476, 580, 668, 788, 892, 1028, 1148, 1300, 1436, 1604, 1756, 1940, 2108, 2308, 2492, 2708, 2908, 3140, 3356, 3604, 3836, 4100, 4348, 4628, 4892, 5188, 5468, 5780, 6076, 6404, 6716, 7060, 7388, 7748, 8092, 8468, 8828, 9220, 9596

In addition, when each entry is divided by 4 the sequence is identical to the Sloane number A214345:
1, 1, -1, 1, 1,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, 901, 959, 1025, 1087, 1157, 1223, 1297, 1367, 1445, 1519, 1601, 1679, 1765, 1847, 1937, 2023, 2117, 2207, 2305, 2399

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

For the tuple (1,13,9)   f is calculated to be:
f = [2e2n2 + (36 − 52)en − 256]/2×16 = [2e2n2 − 16en − 256]/32
and by setting e = 4 affords the general equation f = n2 − 2n − 8
Substituting this value of f in
(f + 1, f + 4n + 13, f + 8n + 9) as was shown in Part IA
gives the general equations for the complete sequence starting at point (1,13,9)

a = (n2 − 2n − 8 + 1 ) = (n2 − 2n − 7 )
b = (n2 − 2n − 8 + 4n + 13 ) = (n2 + 2n + 5)
c = (n2 − 2n − 8 + 8n + 9) = (n2 + 6n + 1)

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

a = (16n2 − 8n − 7 )
b = (16n2 + 2n + 5)

Using these equations (or copying directly from Table II) we obtain for the fourth sequence identical to the Sloane No. A214405:

-7, 5, 1, 29, 41, 85, 113, 173, 217, 293, 353, 445, 521, 629, 721, 845, 953, 1093, 1217, 1373, 1513, 1685, 1841

So in effect what we have done is to produce four new sequences via a completely new route (the Sloane numbers A214393 and A214405 are already known). Previous methods would have generated one sequence without the knowledge that others existed.In addition, both sequences are related via the general sequence formula (before factoring in fs) and thus constitute a family of interleaved sequences.

This concludes Part C. Go back to homepage.

Copyright © 2012 by Eddie N Gutierrez. E-Mail: Fiboguti89@Yahoo.com