1

Prime generating formulae. By Gary Robert Adolphson.©

Introduction.

This study examines the behaviour of prime numbers as they form sequences produced through the
use of a specific type of algebraic expression, the quadratic trinomial. As its name signifies, this
particular equation is comprised of three parts, (terms), one of which contains a square.

The subject of this investigation rose to prominence in the latter part of the eighteenth century
when the great mathematician Leonard Euler revealed that x² + x + 41, when x equalled 0 to 39,
produced an unbroken string of prime numbers, forty units long. This unprecedented discovery
offered hope, that perhaps the primes were not just randomly scattered throughout the number
line, after all.

Towards the close of that same century, the inspired, Adrian Marie Legendre disclosed that, 2n² +
29, when n equalled 0 to 28, generated its own ‘string of primes,’ this one twenty nine units long. A
brilliant start indeed to this exclusive little branch of arithmetic, but alas, centuries roll on by while
the notion of formulaic structure of the primes languishes in the history books.

Small gains are made by the close of the twentieth century and although some impressive finds have
kicked off the twenty-first century, there seemed to be little or no connection between these rather
obscure events.

Recent studies however, have shown that these expressions are not isolated, but rather, form
coherent sequences, and that there is a direct link between certain trinomials. Prime numbers are
shown to form harmonious relationships with both squares and triangles as together they follow the
algebraic rhythms.

Euler’s formula remains the best possible example of its type for a number of reasons, not least for
its longevity. Not only is it the first member of its own sequence of suchlike prime generating
trinomials, it is the first member of all subsequent suchlike trinomials.

Each quadratic trinomial has its ‘one true form’, however to confuse the issue, they can also be
presented in a variety of forms. The true form is when the equation is in its simplest state, and
where set rules apply for each of the three components. In a variant form these rules do not
necessarily apply and certain information is obscured. It is necessary therefore, to transform a
variant trinomial back to its true form, in order to determine its position in its relevant sequence.

Rules governing the three nomials, (names), in true form.

All quadratic trinomials have an ‘a’ component bonded in multiplication with the n square
component and together they make up the first term, an². This part of the equation remains
unchanged by any transformation. The ‘a’ component is responsible for the ‘rate of increase’ of the
sequence of integers generated, which is set at 2a. For example, in Euler’s formula, the ‘a’
component has a value of one, and Euler’s primes therefore increase by two with each iteration, 2,
4, 6, 8, etc..

Because the ‘b’ component reduces to zero in certain cases, the middle term will then be absent.
Excepting when ‘b’ is zero, the middle term in its true form is always both plus and minus, thus

Copyright 2016 G.R. Adolphson.

 2

generating two separate sequences of integers. When ‘b’ is either equal to ‘a’, or twice its value, the
two sequences are identical and the trinomial is then the first, (initial), member of its generation.
When ‘b’ and ‘a’ do not have these ratios, the two sequences generated, (subsequent), begin with
the same prime when n = 0, but thereafter, take different paths.

All true form prime generating quadratic trinomials feature a ‘c’ component as the third term. This is
an integer, usually prime, that can be either plus or minus. In the initial case, the ‘c’ component is
responsible for the length of a certain periodic event or cycle. All subsequent equations that follow
in sequence are a direct result of these cycles and their ‘c’ component is related to the initial ‘c’
through a specific formula. (See table 2.).

The ‘c’ component can be replaced with another suitable prime without changing the type of the
trinomial or its fundamental behaviour. Euler’s formula for example, works in the same manner with
11, or 17, only the cycles are shorter.

Cyclic formulae.

When the integers of the sequence generated by Euler’s formula are closely observed, well beyond
the first forty primes, a certain cyclic occurrence becomes evident. On every multiple of 41, in terms
of rank*, a new cycle begins, and is recognised as, a new sequence of composite numbers being
introduced into the stream.*Note; rank, (r), is equal to n+1. (See appendix, table1.).

Following on from the ‘original set’ of forty primes, the first cycle, (c1), begins at rank number 41 and
starts with 41². The new sequence of composites introduced here, is comprised exclusively of
multiples between consecutive members of the original set, i.e. 41.41, 41.43, 43.47, etc.. The prime
numbers continue on to occupy the gaps between these composites in successive groups of, 0, 2, 4,
6, 8, and 10.

The second cycle beginning at rank number 82 heralds a significant change. The composites
introduced in this cycle, are comprised of members of the original set, in multiplication with
completely ‘new’ primes, i.e. 41.163, 41.167, 43.167, 43.179, etc.. This sequence of new primes is
defined by the second quadratic equation, 4n² + 163 = prime, for n = 0 to 19, giving an unbroken
string, twenty units long. This is exactly half the span of the original set and marks a precedent for all
that follows.

The third cycle, beginning at rank 123, sees the introduction of the sequence of composites whose
‘new’ prime component is defined by the third trinomial, 9n² ± 3n + 367, for n = 0 to 12.

The fourth cycle begins at rank 164 and so the pattern continues. The sequence of composites
introduced in this cycle is, as always, a compound of ‘original’, and ‘new’ primes, the latter being
defined by the next trinomial, 16n² ± 8n + 653.

All equations so far have been determined empirically and there is now enough data to make some
projections.

Copyright 2016 G.R. Adolphson.

 3

Rules governing the progression of sequential equations.

The following rules apply to Euler’s equation and all suchlike initial equations, i.e., where ‘b’ equals
‘a’. There is a separate rule for each of the three components. The common factors in all three are
the initial ‘a’ value, and the sequence number of the quadratic, given as ‘q’, i.e., its rank in the
sequence of equations.

For ‘a’, the sequence progresses as per (aq)².

For ‘b’, either, aq.(aq-2), or ((aq-1))² -1.
For ‘c’, the rule is, aq².c - (aq-1), if initial ‘c’ is plus, or aq².c + (aq-1), if it is minus.

It is now possible to construct the sequence of quadratic trinomials ad infinitum; however for the
time being, the first eleven will suffice. (see table 2.)

Table 2. Sequence of quadratic trinomial ‘prime’ formulae, from Euler’s n² + n + 41.

an² ± bn + c. Pn’s Pn’s Start at

q a = (aq)² b = aq.(aq – 2) c = (aq)².41 – (aq – 1) +bn -bn Rank n.
1 1n² ± 1n + 41 40 40 41
2 4n² ± 0n + 163 20 82
3 9n² ± 3n + 367 13 13 123
4 16n² ± 8n + 653 9 8 164
5 25n² ± 15n + 1021 8 16 205
6 36n² ± 24n + 1471 6 5 246
7 49n² ± 35n + 2003 5 5 287
8 64n² ± 48n + 2617 3 5 328
9 81n² ± 63n + 3313 2 9 369
10 100n² ± 80n + 4091 2 11 410
11 121n² ± 99n + 4951 2 7 451

The first eleven equations produce strings of prime numbers and although some are quite short, the
pattern is obvious. Each introduces composites in a similar fashion to the first case, after which the
streams of prime numbers continue on. This trend remains even though equations 12 to 16
introduce their sequence of composites right at the start, they then continue on with primes. The
seventeenth equation serves to demonstrate this continuity where, (17n)² + 255n + 11833 = prime
for n = 0 to 10.

Euler’s equation and the difference of two squares, (D.O.T.S.).

Euler’s sequence can be constructed by a different method, a simple algorithm that shows a
distinction between the first forty primes and all that follows. Each member of the sequence is
composed of two parts, a square component and a whole number component. The system begins
with 0² + 41, followed by 1² + 40, 2² + 39, 3² + 38, etc.. In this perception the sequence of forty
primes acts as a countdown to a system that actually begins at 41², on rank number 41 and where
hereafter, the integer component has a negative value.

When this negative integer component adds to a square, the rules governing the difference of two
squares, (D.O.T.S.), ensure that the sequence member thus defined cannot be a prime. (see table 3).

Copyright 2016 G.R. Adolphson.

 4

Table 3. Euler sequence, n² ± n + 41, as r² + (41-r), the D.O.T.S., where r, (rank) = n + 1.

r c0 r² + (41-r) r c1 r² + (41-r)
0 41 0² + 41 41 41.41 41²
1 41 1² + 40 42 41.43 42² - 1²
2 43 2² + 39 43 1847
3 47 3² + 38 44 1933
4 53 4² + 37 45 43.47 45² - 2²
5 61 etc. 46 2111
6 71 = 47 2203
7 83 = 48 2297
8 97 = 49 2393
9 113 = 50 47.53 50² - 3²
10 131 = 51 2591
11 151 = 52 2693
12 173 = 53 2797
13 197 = 54 2903
14 223 = 55 3011
15 251 = 56 3121
16 281 = 57 53.61 57² - 4²
17 313 = 58 3347
18 347 = 59 3463
19 383 = 60 3581
20 421 = 61 3701
21 461 = 62 3823
22 503 = 63 3947
23 547 = 64 4073
24 593 = 65 4201
25 641 = 66 61.71 66² - 5²
26 691 = 67 4463
27 743 = 68 4597
28 797 = 69 4733
29 853 = 70 4871
30 911 = 71 5011
31 971 = 72 5153
32 1033 = 73 5297
33 1097 = 74 5443
34 1163 = 75 5591
35 1231 = 76 5741
36 1301 = 77 71.83 77² - 6²
37 1373 37² + 4 78 6047
38 1447 38² + 3 79 6203
39 1523 39² + 2 80 6361
40 1601 40² + 1 81 6521

Copyright 2016 G.R. Adolphson.

 5

Legendre’s equation, 2n² + 29, and the difference of two triangles, (D.O.T.T.).

Legendre’s famous formula, like Euler’s, is also an initial equation with its own generations, however
there are significant differences, and a big surprise. When the integers generated by Legendre’s
equation are closely observed, well beyond the first twenty-nine primes, a cyclic occurrence
becomes evident, but in this one, unlike Euler’s, the ‘new primes’ are introduced in the first cycle.
(See appendix, table 9.).

A surprise encounter occurs when this sequence of new primes is converted into its true form
quadratic trinomial, for there is the well known equation attributed to Honaker, 4n² ± 4n + 59 =
prime for n = 0 to 13. (Ref. Wikipedia).

Honaker’s trinomial is itself an ‘initial’ equation of the Euler type, and therefore it generates its own
sequence of equations by the rules given. (See appendix, page 14.). These however are a different
set of rules to the Legendre sequence, where it is found as equation number two. In other words it
participates in two different sequences of equations in two different ways. (See table 5.).

Whereas Euler’s sequence of primes concludes on a square, Legendre’s run culminates on a triangle.
In order to portray the integration of composites into Legendre’s sequence, in the same clear and
concise manner as in Euler’s D.O.T.S., it is necessary to introduce, the D.O.T.T.. (See appendix, p16.).

In this system, each member is defined by a triangle component, denoted by n^, and an integer
component and begins with, 0^+29, followed by, 2^+28, 4^+27, 6^+26, etc.. The integers count
down to zero as the triangles increase by two with each iteration, to conclude at 58^ on rank 29. This
is the beginning of the first cycle, which is defined by the D.O.T.T.. As it was with the squares, so it is
with the triangles, the prime numbers continue on to occupy the gaps between these composites in
successive groups of 0, 1, 2, 3, 4, 5, and 6. (See table 4.).

Rules for Legendre’s sequential equations.

As it was in Euler’s case, the first few equations are determined empirically until a pattern can be
established. This being done the progression was found to be quite different to Euler’s. Legendre’s
equation generates a sequence of quadratic trinomials no doubt, yet it is in a way, detached from
the sequence.

The ‘a’ component in the sequence, progresses as before, i.e. (aq)², from Honaker’s equation
onward. It is here that the ‘b’ component also begins and progresses in increments of 2aq. The ‘c’
component is also seen to be remote from the sequence it generates, by the rule, aq².29 + 1. (see
table 5.).

Just as in Euler’s case, the equations continue ad infinitum and a clear pattern is evident, however
Legendre’s sequences hold more surprises.

Copyright 2016 G.R. Adolphson.

 6

Table 4. Legendre’s sequence, from 2n² + 29, as ((2r))^ +(29-r), the D.O.T.T., where r = n.

r c0 ((2r))^+(29-r) r c1 ((2r))^+(29-r)
0 29 0^ + 29 29 29.59 58^
1 31 2^ + 28 30 31.59 60^ - 1^
2 37 4^ + 27 31 1951
3 47 6^ + 26 32 31.67 64^ - 2^
4 61 etc. 33 2207
5 79 = 34 2341
6 101 = 35 37.67 70^ - 3^
7 127 = 36 2621
8 157 = 37 2767
9 191 = 38 2917
10 229 = 39 37.83 78^ - 4^
11 271 = 40 3229
12 317 = 41 3391
13 367 = 42 3557
14 421 = 43 3727
15 479 = 44 47.83 88^ - 5^
16 541 = 45 4079
17 607 = 46 4261
18 677 = 47 4447
19 751 = 48 4637
20 829 = 49 4831
21 911 = 50 47.107 100^ - 6^
22 997 = 51 5231
23 1087 = 52 5437
24 1181 = 53 5647
25 1279 = 54 5861
26 1381 52^ + 3 55 6079
27 1487 54^ + 2 56 6301
28 1597 56^ + 1 57 61.107 114^ - 7^

Table 5. Sequence of equations generated by Legendre’s formula 2n² + 29.

an² ±bn +c Pn’s Pn’s Start at

q a = (aq)² b = 2aq c = aq². 29 + 1 +bn -bn Rank n.
0 2n² ± 0n +29 29 0
1 4n² ± 4n + 59 14 14 29
2 16n² ± 8n + 233 7 7 58
3 36n² ± 12n + 523 5 4 87
4 64n² ± 16n + 929 3 18 116
5 100n² ± 20n + 1451 3 2 145
6 144n² ± 24n + 2089 1 1 174
7 196n² ± 28n + 2843 6 2 203

Copyright 2016 G.R. Adolphson.

 7

Wheels within wheels.

The cycle of twenty-nine is now established; however upon closer scrutiny of table 9, it becomes
apparent that another cycle is also in play. Rank number 29 hosts triangular number 58, the first
composite. Unlike the square, as in Euler’s case, whose two prime factors are identical, the two
different factors of the triangle trigger two different cycles, 29 and 59, thus introducing the new
cycle of 59. The first cycle of 59 begins at rank 88, (29 + 59) and as before, a pattern is gained
empirically until the relevant sequential equation rules can be determined.

As it is with the first generation of equations from Legendre’s formula, 2n² + 29 is itself, remote from
the second sequence it generates. The rules for the development of these secondary equations are a
little more complex than those of the first. (See table 6.).

Table 6. Secondary sequential equations from Legendre’s 2n² + 29, cycle of 59.

an² ± bn +c Pn’s Pn’s Start at

q a = a((aq+1))² b = a((aq+1))² - a(aq+1) c = ((aq+1))².29+aq² +bn -bn Rank n.
0 2n² +29 29 0
1 18n² ± 12n +263 9 10 88
2 50n² ± 40n + 733 6 12 147
3 98n² ± 84n + 1493 3 9 206
4 162n² ± 144n + 2381 2 10 265
5 242n² ± 220n + 3559 7 2 324
6 338n² ± 312n + 4973 4 7 383

The natural progression of Euler type equations.

Euler’s equation is the first member of a sequence of trinomial equations in another way. Although
composed of three parts, these equations behave like a two part thing, with ‘a’ and ‘b’ acting
together as one, comprising the main part and the ‘c’ component as the other.

The main part lays down the foundation of the generated sequence as a set pattern, the other part is
then either added to it, taken away from it, or even exchanged for another. It is the main part only
that can be considered as a coherent sequence, with the ‘c’ part seemingly random. (See table 7.).

Table 7. A sequence of selected Euler type prime generating equations

q an² ± bn + or -, c Pn’s From variant Wikipedia reference

1 1n² ± 1n 41 40 Euler
2 2n² ± 2n -113 22
3 3n² ± 3n -89 24 3n² + 39n + 37 A. Bruno (pers.comm. June 12, 2009).
4 4n² ± 4n 59 14 Honaker
5 5n² ± 5n 13 12
6 6n² ± 6n 31 29 6n² - 342n + 4903 J. Brox (pers. comm. Mar.27, 2006).
7 7n² ± 7n -43 27 7n² - 371n + 4871 F. Gobbo (pers. comm. Dec. 26, 2005).
8 8n² ± 8n -197 31 8n² - 488n + 7243 F. Gobbo (pers. comm. Dec 27, 2005).
9 9n² ± 9n 43 13
10 10n² ± 10n -19 10

Copyright 2016 G.R. Adolphson.

 8

A search for suitable equations to form members of such a sequence turned up some very
interesting finds. Four of the finest examples of this type of trinomial have only recently been
discovered and are currently known in their variant form. (See table 7. q 3, 6, 7, and 8.).

When transformed into true form, these equations reveal much about themselves as individual
entities and much more about their type in general terms. For example the third equation, 3n² ± 3n -
89, ends its run of primes on 58^, a strange coincidence?, but then after five more primes, 73^
appears, followed closely by 59², then 73². This is beyond coincidence, here, squares, triangles and
primes work together in harmony to generate many more strings of primes, along with their relevant
equations.

Equations 3, 6,7 and 8 provide excellent examples of long sequences of primes and subsequent
sequences of equations, which then in turn offer more long strings of primes. They also provide
some good examples of the minus ‘c’ component. (See appendix.).

When ‘c’ is minus, the primes generated by such an equation, start out as minus, but they then
approach zero and become positive thereafter. However when the initial ‘c’ is minus, all subsequent
‘c’s’ generated by the third rule, remain as minus. (See below).

A new way to generate prime sequences.

The rules used to generate the ‘c’ component sequences from initial type trinomials, are prime
generating equations in their own right. These equations operate on a completely different principle
to the quadratic type using multiplication rather than addition.

Quadratic number two of the Euler type provides an excellent example. In this version the ‘c’
component is minus 83. (See below.).

2n² ± 2n - 83, equals prime when n equals 0 to 16, they are :

-83, -79, -71, -59, -43, -23, 1, 29, 61, 97, 137, 181, 229, 281, 337, 397, 461.

2q² . -83 + 2q - 1, equals prime when q equals 1 to 11, they are:

-83: -167, -667, -1499, -2663, -4159, -5987, -8147, -10639, -13463, -16619, -20107.

Harmony.

Prime generating quadratic trinomial equations demonstrate a kind of purity that only prime
numbers can offer. The clear and uncomplicated example left to us by Euler, shines a light on the
more complex workings of all others. These expressions refer to interconnected systems involving
squares, triangles and primes.

Goldbach, in 1752, proved that n does not provide a prime for every integer, in any polynomial
equation. Every run of primes must eventually include composites and precisely how this happens is
of interest here. Euler’s case exemplifies natural harmony in its progression. Harmony in nature
takes the path of least resistance and that is why the first composite, is of the first prime, i.e., 41.
Each prime appears twice in composite form, except for the first, which appears three times, i.e.
41.41, 41.43, 43.47, 47.53, etc..

Copyright 2016 G.R. Adolphson.

 9

When the first change occurs and the first new equation, 4n² + 163, defines the first new line of
primes, what then happens, at the end of this line, once more indicates harmony. The purity of the
primes is interrupted by the least possible intrusion. Once again, Euler’s original set of primes form
the first composites and once again they constitute a system of the D.O.T.S.. This time with the even
squares as component ‘a’, and from the first composite onward, the minus, odd number squares as
the ‘b’ component. (See table 8.).

When the sequence of new primes arrives in this equation, they are not ‘new’ at all. These are the
very same set of numbers as defined by the third equation of Euler’s sequence. These primes are
now reused in other harmonious combinations with the original set. (See table 8, r62,63,64,67, etc.).

Only certain primes are allowed to enter the entire system, that is, those first defined by the
sequential equations. They are then recycled over and over in various combinations, as harmony
dictates.

Table 8. 4n² + 163

r c0 r c1 r c2 r c3
0 167 0²+167 21 41.43 42²-1² 42 71.97 84²-13² 63 41.379
1 163 2²+159 22 41.47 44²-3² 43 7219 64 43.373
2 167 4²+151 23 2099 44 7559 65 16547
3 179 6²+143 24 43.53 48²-5² 45 7907 66 113.151 132²-19²
4 199 = 25 2467 46 8263 67 43.409
5 227 = 26 2663 47 8627 68 18119
6 263 = 27 47.61 54²-7² 48 8999 69 47.397
7 307 = 28 3079 49 83.113 98²-15² 70 19207
8 359 = 29 3299 50 9767 71 19763
9 419 = 30 3527 51 10163 72 20327
10 487 = 31 53.71 62²-9² 52 10567 73 20899
11 563 = 32 4007 53 10979 74 47.457
12 647 = 33 4259 54 11399 75 22067
13 739 = 34 4519 55 11827 76 131.173 142²-21²
14 839 = 35 4787 56 12263 77 53.439
15 947 = 36 61.83 72²-11² 57 97.131 114²-17² 78 23879
16 1063 = 37 5347 58 13159 79 24499
17 1187 = 38 5639 59 13619 80 25127
18 1319 = 39 5939 60 14087 81 25763
19 1459 = 40 6247 61 14563 82 26407
20 1607 40²+7 41 6563 62 41.367 83 27059

Copyright 2016 G.R. Adolphson.

 10

Appendix.

Table 1. Euler’s sequence in cycles of 41.

r= c.0 r= c.1 r= c.2 r= c.3 r= c.4 r= c.5

0 41 41 41.41 82 41.163 123 41.367 164 41.653 205 41.1021
1 41 42 41.43 83 41.167 124 41.373 165 41.661 206 41.1031
2 43 43 1847 84 7013 125 15541 166 27431 207 42683
3 47 44 1933 85 43.167 126 15791 167 27763 208 71.607
4 53 45 43.47 86 7351 127 61.263 168 28097 209 53.821
5 61 46 2111 87 7523 128 43.379 169 28433 210 197.223
6 71 47 2203 88 43.179 129 16553 170 28771 211 44351
7 83 48 2297 89 7873 130 16811 171 43.677 212 44773
8 97 49 2393 90 83.97 131 43.397 172 29453 213 45197
9 113 50 47.53 91 8231 132 17333 173 83.359 214 43.1061
10 131 51 2591 92 47.179 133 17597 174 43.701 215 46051
11 151 52 2693 93 8597 134 17863 175 30491 216 53.877
12 173 53 2797 94 8783 135 18131 176 30841 217 43.1091
13 197 54 2903 95 8971 136 18401 177 31193 218 113.419
14 223 55 3011 96 9161 137 71.263 178 31547 219 71.673
15 251 56 3121 97 47.199 138 18947 179 61.523 220 48221
16 281 57 53.61 98 9547 139 47.409 180 32261 221 48661
17 313 58 3347 99 9743 140 19501 181 32621 222 49103
18 347 59 3463 100 9941 141 131.151 182 32983 223 49547
19 383 60 3581 101 10141 142 20063 183 33347 224 49993
20 421 61 3701 102 10343 143 20347 184 33713 225 50441
21 461 62 3823 103 53.199 144 47.439 185 173.197 226 50891
22 503 63 3947 104 1073 145 20921 186 47.733 227 51343
23 547 64 4073 105 97.113 146 21211 187 97.359 228 51797
24 593 65 4201 106 11171 147 21503 188 61.577 229 52253
25 641 66 61.71 107 11383 148 71.307 189 35573 230 52711
26 691 67 4463 108 11597 149 22093 190 35951 231 53171
27 743 68 4597 109 11813 150 22391 191 47.773 232 53633
28 797 69 4733 110 53.227 151 22691 192 36713 233 47.1151
29 853 70 4871 111 12251 152 22993 193 37097 234 54563
30 911 71 5011 112 12473 153 23297 194 37483 235 113.487
31 971 72 5153 113 12697 154 23603 195 37871 236 55501
32 1033 73 5297 114 12923 155 23911 196 38261 237 223.251
33 1097 74 5443 115 13151 156 53.457 197 38653 238 47.1201
34 1163 75 5591 116 13381 157 24533 198 39047 239 56923
35 1231 76 5741 117 13613 158 24847 199 39443 240 61.941
36 1301 77 71.83 118 61.227 159 25163 200 39841 241 57881
37 1373 78 6047 119 14083 160 83.307 201 40241 242 58363
38 1447 79 6203 120 14321 161 25801 202 97.419 243 83.709
39 1523 80 6361 121 14561 162 151.173 203 41047 244 59333
40 1601 81 6521 122 113.131 163 53.499 204 41453 245 59821

Copyright 2016 G.R. Adolphson.

 11

Table 9. Legendre’s sequence in cycles of 29

r c0 r c1 r c2 r c3 r c4 r c5
0 29 29 29.59 58 29.233 87 29.523 116 29.929 145 29.1451
1 31 30 31.59 59 6991 88 59.263 117 27407 146 37.1153
2 37 31 1951 60 7229 89 59.269 118 61.457 147 59.733
3 47 32 31.67 61 31.241 90 16229 119 28351 148 59.743
4 61 33 2207 62 7717 91 47.353 120 127.227 149 157.283
5 79 34 2341 63 31.257 92 31.547 121 29311 150 37.1217
6 101 35 37.67 64 8221 93 17327 122 83.359 151 45631
7 127 36 2621 65 61.139 94 31.571 123 31.977 152 46237
8 157 37 2767 66 8741 95 101.179 124 30781 153 79.593
9 191 38 2917 67 9007 96 18461 125 31.1009 154 31.1531
10 229 39 37.83 68 9277 97 47.401 126 61.521 155 48079
11 271 40 3229 69 9551 98 19237 127 83.389 156 31.1571
12 317 41 3391 70 9829 99 67.293 128 32797 157 107.461
13 367 42 3557 71 10111 100 20029 129 33311 158 49957
14 421 43 3727 72 37.281 101 20431 130 33829 159 50591
15 479 44 47.83 73 10687 102 67.311 131 34351 160 51229
16 541 45 4079 74 79.139 103 21247 132 34877 161 51871
17 607 46 4261 75 11279 104 21661 133 35407 162 52517
18 677 47 4447 76 37.313 105 22079 134 127.283 163 79.673
19 751 48 4637 77 11887 106 22501 135 36479 164 107.503
20 829 49 4831 78 12179 107 101.227 136 37021 165 157.347
21 911 50 47.107 79 12511 108 23357 137 37567 166 67.823
22 997 51 5231 80 12829 109 37.643 138 47.811 167 55807
23 1087 52 5437 81 13151 110 24229 139 38671 168 56477
24 1181 53 5647 82 13477 111 24671 140 39229 169 67.853
25 1279 54 5861 83 13807 112 25117 141 39791 170 57829
26 1381 55 6079 84 79.179 113 37.691 142 40357 171 58511
27 1487 56 6301 85 14479 114 26021 143 40927 172 59197
28 1597 57 61.107 86 14821 115 26479 144 47.883 173 59887

Copyright 2016 G.R. Adolphson.

 12

Prime generating sequential equations .

Euler

1/ n² ± n + 41 =prime for n = 0 – 39.

2/ 4n² + 163 0 – 19.

3/ 9n² ± 3n + 367 0-12, 0-12.

4/ 16n² ± 8n + 653 0-8, 0-7.

5/ 25n² ± 15n + 1021 0-7, 0-15.

6/ 36n² ± 24n + 1471 0-5, 0-4.

7/ 49n² ± 35n + 2003 0-4,0-4.

8/ 64n² ± 48n + 2617 0-2, 0-4.

9/ 81n² ± 63n + 3313 0-1, 0-8.

10/ 100n² ± 80n + 4091 0-1, 0-10.

11/ 121n² ± 99n + 4951 0-1, 0-6.

12/ 144n² ± 120n + 58937183

Legendre.

0/ 2n² + 29 0 – 28.

1/ 4n² ± 4n + 59 (Honaker.) 0 – 13.

2/ 16n² ± 8n + 233 0-6, 0-6.

3/ 36n² ± 12n + 523 0-4, 0-3.

4/ 64n² ± 16n + 929 0-2, 0-17.

5/ 100n² ± 20n + 1451 0-2, 0-1.

6/ 144n² ± 24n + 2089 0, 0.

7/ 196n² ± 28n + 2843 0-5, 0-1.

8/ 256n² ± 32n + 37134779

Copyright 2016 G.R. Adolphson.

 13

0/ 2n² ± 2n – 83

1/ 4n² - 167

2/ 16n² ± 8n – 667

3/ 36n² ± 24n – 1499

4/ 64n² ± 48n – 2663

5/ 100n² ± 80n – 4159

6/ 144n² ± 120n – 5987

7/ 196n² ± 168n – 8147

8/ 256n² ± 224n – 10639

9/ 324n² ± 288n – 13463

10/ 400n² ± 360n – 16619

11/ 484n² ± 440n – 20107

12/ 576n² ± 528n – 2392771337

0/ 3n² ± 3n – 89 0 – 23.

1/ 9n² ± 3n – 269 0-14, 0-13.

2/ 36n² ± 24n – 10732937

3/ 81n² ± 63n – 2411

4/ 144n² ± 120n – 4283

5/ 225n² ± 195n – 6689

6/ 324n² ± 288n – 9629

7/ 441n² ± 399n – 13101

8/ 576n² ± 528n – 1711171241

Copyright 2016 G.R. Adolphson.

 14

0/ 4n² ± 4n + 59 0 – 13. Secondary equations.

1/ 16n² ± 8n + 233 0-6, 0-6. 18n² ± 12n + 163 0-9, 0-8.

2/ 64n² ± 48n + 937

3/ 144n² ± 120n + 2113

4/ 256n² ± 224n + 3761

5/ 400n² ± 360n + 5881

6/ 576n² ± 528n + 847337229

0/ 5n² ± 5n + 13

1/ 25n² ± 15n + 61

2/ 100n² ± 80n + 251

3/ 225n² ± 195n + 571

4/ 400n² ± 360n + 1021

5/ 625n² ± 575n + 1601

6/ 900n² ± 840n + 2311

7/ 1225n² ± 1155n + 315123137

0/ 6n² ± 6n + 31 0-28.

1/ 36n² ± 24n + 181 0-4, 0-24. 12n² + 59 0-14.

2/ 144n² ± 120n + 733 0-7, 0-11. 18n² ± 6n + 89 0-9, 0-19.

3/ 324n² ± 288n + 1657 48n² ± 24n + 239 0-14, 0-6.

4/ 576n² ± 528n + 2953

5/ 900n² ± 840n + 4621

6/ 1296n² ± 1224n + 6661

7/ 1764n² ± 1680n + 907343211

Copyright 2016 G.R. Adolphson.

 15

0/ 7n² ± 7n – 43 0 – 26.

1/ 49n² ± 35n – 307

2/ 196n² ± 168n – 1217

3/ 441n² ± 199n – 2729

4/ 784n² ± 728n - 484329167

0/ 8n² ± 8n – 197 0 – 30.

1/ 64n² ± 48n – 1583

2/ 256n² ± 224n – 63197189

3/ 576n² ± 528n – 14207

4/ 1024n² ± 960n – 25247

5/ 1600n² ± 1520n – 39439

6/ 2304n² ± 2208n – 56783

7/ 3136n² ± 3024n – 77279

8/ 4096n² ± 3968n – 100927

9/ 5184n² ± 5040n – 127727

10/ 6400n² ± 6240n – 157679

11/ 7744n² ± 7568n - 190783

12/ 9216n² ± 9024n - 227039892551

0/ 9n² ± 9n + 43

1/ 81n² ± 63n + 379

2/ 324n² ± 288n + 1531

3/ 729n² ± 675n + 3457

4/ 1296n² ± 1224n + 615747131

Copyright 2016 G.R. Adolphson.

 16

Triangular numbers.
𝑛
n^ = . (𝑛 + 1)
2

The difference of two triangles, D.O.T.T..

As it is with squares, one triangle must be odd and the other even, however unlike the squares, the
kind of integer ‘triangled’ is not necessarily the same kind as the triangular number it represents. For
example, 13^ = 91, is good, as both are odd numbers but then 14^ = 105, and 15^ = 120. This must
be known as two different rules apply.

If the two triangles are the same, i.e. odd minus odd, or even minus even, then
𝑎−𝑏
Same. a^ - b^ = ( 2
) . (𝑎 + 𝑏 + 1)

If the two triangles are different, i.e. odd minus even, or even minus odd, then
𝑎+𝑏+1
Diff. a^ - b^ = (𝑎 − 𝑏) . ( 2
)

Copyright 2016 G.R. Adolphson.