HOME plateWON | World!OfNumbers Smoothly UndulatingPalindromic Primes (SUPP's) 1   2   3   4   5   6  Near Smoothly Undulating Primes NSUP's (with 6-digit undulators) Near Smoothly Undulating Primes NSUP's (with 22-digit undulators) Palindromic Wing Primes Plateau & Depres. Primes Palindromic Merlon Primes Home Primes Circular Primes SUPP-sorted

Smoothly Undulating Palprimes

Smoothly Undulating Palindromic Primes (or SUPP's for short)
are numbers that are primes, palindromic in base 10, and the digits alternate,
but why smooth one might ask !
The smoothness was added to make a difference with the normal
undulating numbers. The description for normal undulating numbers
is that the next digits alternately go up and down (or down and up)
but the absolute difference values between two adjacent digits may differ.
(e.g. 906343609)
In a smoothly undulating number the absolute difference values
between two adjacent digits are always equal, therefore only two distinct
digits can appear in the number.
(e.g. 74747474747474747)

Actually, it was Charles Trigg who coined the term smoothly... in the following reference
C. W. Trigg, “Palindromic Octagonal Numbers”,
Journal of Recreational Mathematics, 15:1, pp.41-46, 1982-83.

Sources were I found some SUPP's ¬
The Top Ten Prime Numbers by Rudolf Ondrejka
Palindrome prime number patterns by Harvey Heinz
Liczby pierwsze o szczególnym rozmieszczeniu cyfr by Andrzej Nowicki
Translated in Dutch "Priemgetallen met een speciale rangschikking van cijfers"
Translated in English "Prime numbers with a special arrangement of digits"
In case one should discover more sources I will be most happy
to add them to the list. Just let me know.

SUPP's sorted by length

Messages

[ October 21, 2004 ]
Some nontrivial combinations can never produce primes...
By Julien Peter Benney (email)

(76)w7 is always composite because:
if w is of form 3n, then 7 is a divisor;
if w is of form 3n+1, then 13 is a divisor;
if w is of form 3n+2, then 3 is a divisor.

(71)w7 is composite in the following general cases:
if w is of form 3n, then 7 is a divisor;
if w is of form 3n+1, then 3 is a divisor.

(34)w3 is composite in the following general cases:
if w is of form 3n, then 3 is a divisor;
if w is of form 3n+1, then 7 is a divisor.

Thus in both last cases only for w of the form 3n+2
is there any chance of a prime !

[ February 9, 2001 ]
Jeff Heleen wrote :

" As far as I could see you didn't have a section on your site for these numbers.
While I'm sure someone somewhere must have done this before, I have done it also.
Within the limitations of the program I believe these are ALL the smoothly undulating
palindromic prime numbers with two distinct digits each, smaller than 843 digits long.
I used a modified APRT-CLE program in UBASIC to automate and perform the search
on a Pentium_II 300 MHz laptop."

That is indeed a very nice and interesting compilation, thanks Jeff. Great job!
At the same time it is a topic that might attract other dedicated number crunchers.
Perhaps you know a source where larger SUPP's are displayed.
Those are welcome as well! Send them in and I'll add them to the table.

[ February 12, 2001 ]
Jeff Heleen wrote :

" I have found the following website:
http://www.utm.edu/research/primes/lists/top_ten/topten.pdf
where, if you will look on page 43 (of 93) you will see the top ten
SUPP's as of February 24, 2001. The smallest two on this list are the same as my
highest two. It doesn't say whether these are ALL there are up to the
highest one shown. However, I suspect not, as they all start and end with
the digit 1. So perhaps there are more to discover in this range."

[ February 14, 2001 ]
Message from Carlos Rivera

There are several extra terms :
(37)k3, is prime for k=424 & 946
(75)k7, is prime for k=539 & 707
(79)k7, is prime for k=838
(92)k9, is prime for k=428
(95)k9, is prime for k=647
In the meanwhile I used PRIMEFORM to get the next pseudoprime
following my record from 1997:
(12)k1, is pseudoprime for k=3904 (7809 digits) far beyond the current
possibilities of rigorous primality testing of the speediest code (TITANIX)
Carlos argues 'As a matter of fact the real SUPP 's
are (for me) numbers (ab)ka, such that abs(a–b)=1
'
explaining why he favours breaking records of the form (12)k1 above the others.

[ April 2001 ]
Start of above date I noticed a new entry in G. L. Honaker, Jr.'s Prime Curios!
website of Landon Curt Noll. A beautiful SUPP, proved prime with special
hardware a few years ago (?), was introduced there, which immediately shattered
Carlos Rivera's previous record !
This SUPP has a length of 2883 digits 3(73)1441
See Prime Curios! 37373...37373
You can contact L. C. Noll through his home page at http://www.isthe.com/chongo/

 The following link includes many details about Landon's proof of the SUPPand why his proof got lost : Yahoo Message 1942 - Is (37*10^2883–73)/99 prime?References:Landon Curt Noll (37*10^2883–73)/99 is primeLandon Curt Noll Misc prime numbersTom Magliery Prime numbers related to 37

[ May 6, 2001 ]
Enters Hans Rosenthal with new and more impressive data !

Here is a probable prime of length 10419 for your SUPP page:
3(13)5209 = 310*(1010418–1)/99+3
I don't know whether this one has been discovered by someone
else before (if you know of this, please send me a note).
Hans added that many more of the _abababa_ type will follow within not too long.
( i.e. a complete list of them up to 20001 digits... which arrived at June 4, 2001 )
By doing so Hans no doubt brought this collection to the point where it will serve
as a standard reference work for this kind of numbers.
Many thanks for your excellent contribution, Hans!

[ June 26, 2001 ]
Carlos Rivera writes the following interesting observations.

1) Any smooth undulating palindrome number composed of two distinct digits
can be expressed in any one of the two forms:

a(ba)n = (ab)na

2) (ab)na = (ab)nx10+a
3) (ab)n = (ab)xR(2n)/R(2)
4) R(k) = (10k –1)/(10–1)

5) Consequently a(ba)n = (ab)na = (ab)x((102n–1)/99)x10+a

6) But:

(ab)x((102n–1)/99)x10+a =
[(ab)x102n+1 – (ab)x10 + 99a]/99 =
[(ab)x102n+1 – (ab)x10 + 100a – a]/99 =
[(ab)x102n+1 – (ba)]/99

7) a(ba)n = (ab)na =  (ab)x((102n–1)/99)x10+a  =  [(ab)x102n+1 – (ba)]/99

8) The form a(ba)n = [(ab)x102n+1 – (ba)]/99 is the one used by you in your
page and formally is correct.

But the second form (ab)na = (ab)x((102n–1)/99)x10+a is a kind of more suitable
one form for primality test purposes, especially if:
° a = 1 &
° [(102n –1)/99] can be factorized until certain extent in order to use classical
theorems like the Pocklington one.

Thanks Carlos for the interesting observations on the formula formats for the SUPP's.
Before Hans Rosenthal entered the stage I used the format you promote in entry 7
(highlighted in yellow).
But Hans convinced me to use to other one for the following reasons.
First the format [(ab)*102n+1–(ba)]/99 displays the exact digitlength
of the SUPP namely via the exponent (2n+1).
Secondly the (ab) and (ba) coefficients indicate straight away how the SUPP starts and ends !

[ September 4, 2001 ]
Hans Rosenthal broke Landon Curt Noll's old record
by prime proving the following SUPP of 3015 digits !

3(23)1507 = (32*103015–23)/99

[ October 19, 2001 ]
Hans Rosenthal sent in a list of five new records.
The largest one he prime proved is the following SUPP of 4859 digits !

9(89)2429 = (98*104859–89)/99
" All Primo certificates have been validated with Cert_Val. The proof of the above
largest known SUPP (second largest known ECPP prime) took exactly 11 weeks
on an Athlon 1.4 GHz, the full validation of this certificate took 20 and a half hours
on the same PC.
I believe that from now on it's a real challenge (also for myself) to complete/enlarge
the SUPP table."

[ October 27, 2002 ]
Hans Rosenthal sent a new SUPP record of 4885 digits !
( Announced at Walter Schneider's site at Undulants )

1(71)2442 = (17*104885–71)/99

The proof was done using Marcel Martin's Primo and took 2008 hours and 57 minutes
on a AMD Athlon 1.33 GHz. The Primo certificate was then validated with Cert_Val which took
on the same PC an additional 25 hours and 11 minutes.

[ December 10, 2002 ]
Hans Rosenthal informs :

ps. This might be an interesting link for the SUPP reference page:
http://www.lix.polytechnique.fr/Labo/Francois.Morain/english-index.html
It's very likely that François Morain will independently verify the Primo
certificate of the (former) "largest known SUPP"...

[ December 22, 2002 ]
David Broadhurst announced via a message (http://groups.yahoo.com/group/primeform/message/2937) in the
User group for the PrimeForm program that
the following SUPP is prime !

1(41)3171 = (14*106343–41)/99

[ December 23, 2002 ]
Reaction from Hans Rosenthal ¬

" Yes, David informed me, nice result, such a proof won't happen every day.
Jim Fougeron double-checked the primality of 1(71)_2442 = (17*10^4885–71)/99
by use of BLS (he only took about 24 hours for that). Both, David and Jim were pretty
lucky with finding enough factors in N–1 for their proofs. However, this can only
work for the SUPP's that start/end in 1 -- it will never work for the others.
I am really glad that I am no longer the only one to contribute new results to the
SUPP page. You should update it and also announce the new record on your main page."

[ July 13, 2003 ]
Hans Rosenthal announced via a message in
Number Theory List (NMBRTHRY@LISTSERV.NODAK.EDU)
that the following SUPP is proven prime !

3(23)3479 = (32*106959–23)/99
He thereby also established a new Primo ECPP world record
performed on a single monoprocessor computersystem.
Congratulations Hans, an impressive achievement !
" I would like to inform you that I have certified the primality of
(32*10^6959–23)/99, a smoothly undulating palindromic prime (SUPP) [1]
having 6959 decimal digits, with the program Primo [2], Marcel Martin's
implementation of the elliptic curve primality proving (ECPP) algorithm.

The Primo certificate of primality is available at
http://www.ellipsa.eu/public/primo/files/ecpp6959.zip (4457 KB)

The certification of this ordinary prime was started on 21 January 2002
with Primo 1.1.0 (tests 1 to 47) and completed on 7 July 2003 with
Primo 2.0.0 (tests 48 to 953) on an AMD Athlon 1.4 GHz. There was one
relevant interruption of the certification process from 29 March 2003,
6:47, until 3 April 2003, 22:45. So the total running time amounts to
approximately 527 days.

I thank Marcel Martin for his help and advice, and most of all, for
making the ECPP algorithm available to the world of PC users in the
most comfortable form I can imagine: his marvellous Primo.

Hans Rosenthal "

[1] http://www.worldofnumbers.com/undulat.htm#
[2] http://www.ellipsa.eu/public/primo/top20.html

```

```

SUPP” + “SUP” Factorization Projects

The starting point of this overview was to mirror Hisanori Mishima's pages regarding SUPP's and SUP's as they seem to be discontinued since 2013 and his website might disappear one day.
At the time I wasn't yet aware that M. Kamada's pages 'abbba.htm' (depression and plateau primes) divided by 11 are often also SUPP's and/or SUP's.
These numbers are only indirectly or implicitly 'smoothly undulating' by considering the odd exponents divided by 11 sometimes multiplied by some 'm' value.
Importantly his lists go up to exponent 300 instead of Mishima's exponent 100 ! Therefore I will add to my mirrored pages from Mishima a link to each Kamada entry were appropriate.

There are of course some SUP's that can never become prime (except the single digits 2, 3, 5, 7), or become SUPP, but are still worth factoring.
Note that 2(02)w, 3(03)w, 4(04)w, 5(05)w, 6(06)w, 7(07)w, 8(08)w and 9(09)w can all be reduced to the 1(01)w case multiplied by d with d = 2, 3, 4, 5, 6, 7, 8, 9.
Hereunder at the left is the table with the remaining list of these SUP's.

Case [k](d1d2)u = [prefix](2-digit undulator). Cases with 6-digit undulators will be investigated at undulsix.htm.
Attentive readers of the factor lists will have noticed with me that some SUP primefactors are themselves near smoothly undulating. 'Near' because of an initial prefix and the 2-digit undulators.
We divide therefore the SUP by a 2 (or a power of 2) or 5 (or a power of 5).
For instance with 2(12)w / 22 which equals 530303030303... I coined the acronym NSUP's for this lot.
In shorthand (21*10n–12)/(99*4) results in [53](03)n. This give rise to a whole new and interesting field where we can try to find evermore primes.
In the above examples we found primes (PRP's) for values n = 3, 5, 7, 21, 77, 103, 143, 521, 1265, 1347, 5017, 9027, 15737, ...
Also watch out for exceptions. E.g. 6(76)w which equals 2 * 2 * 169191919191919... but [169](19)n has a covering set {3, 13, 7} and is always composite ! Hence the added 'AC'.

 SUP (Smoothly Undulating Composite Palindromes) reference files 2(12)w = (21*10n–12)/99 facsup212.htm (maint. by P. De Geest). aba(2,1,n)=212...212 (n=1 to 100) (Hisanori Mishima) All factored (n ⩽ 100) 2(32)w = (23*10n–32)/99 facsup232.htm (maint. by P. De Geest). aba(2,3,n)=232...232 (n=1 to 100) (Hisanori Mishima) Free to factor    1 remaining 2(52)w = (25*10n–52)/99 facsup252.htm (maint. by P. De Geest). aba(2,5,n)=252...252 (n=1 to 100) (Hisanori Mishima) Free to factor    1 remaining 2(72)w = (27*10n–72)/99 facsup272.htm (maint. by P. De Geest). aba(2,7,n)=272...272 (n=1 to 100) (Hisanori Mishima) Free to factor    1 remaining 2(92)w = (29*10n–92)/99 facsup292.htm (maint. by P. De Geest). aba(2,9,n)=292...292 (n=1 to 100) (Hisanori Mishima) Free to factor    7 remaining 4(14)w = (41*10n–14)/99 facsup414.htm (maint. by P. De Geest). aba(4,1,n)=414...414 (n=1 to 100) (Hisanori Mishima) All factored (n ⩽ 100) 4(34)w = (43*10n–34)/99 facsup434.htm (maint. by P. De Geest). aba(4,3,n)=434...434 (n=1 to 100) (Hisanori Mishima) All factored (n ⩽ 100) 4(54)w = (45*10n–54)/99 facsup454.htm (maint. by P. De Geest). aba(4,5,n)=454...454 (n=1 to 100) (Hisanori Mishima) All factored (n ⩽ 100) 4(74)w = (47*10n–74)/99 facsup474.htm (maint. by P. De Geest). aba(4,7,n)=474...474 (n=1 to 100) (Hisanori Mishima) Free to factor    8 remaining 4(94)w = (49*10n–94)/99 facsup494.htm (maint. by P. De Geest). aba(4,9,n)=494...494 (n=1 to 100) (Hisanori Mishima) Free to factor    9 remaining 5(15)w = (51*10n–15)/99 facsup515.htm (maint. by P. De Geest). aba(5,1,n)=515...515 (n=1 to 100) (Hisanori Mishima) All factored (n ⩽ 100) 5(25)w = (52*10n–25)/99 facsup525.htm (maint. by P. De Geest). aba(5,2,n)=525...525 (n=1 to 100) (Hisanori Mishima) All factored (n ⩽ 100) 5(35)w = (53*10n–35)/99 facsup535.htm (maint. by P. De Geest). aba(5,3,n)=535...535 (n=1 to 100) (Hisanori Mishima) All factored (n ⩽ 100) 5(45)w = (54*10n–45)/99 facsup545.htm (maint. by P. De Geest). aba(5,4,n)=545...545 (n=1 to 100) (Hisanori Mishima) Free to factor    1 remaining 5(65)w = (56*10n–65)/99 facsup565.htm (maint. by P. De Geest). aba(5,6,n)=565...565 (n=1 to 100) (Hisanori Mishima) Free to factor    10 remaining 5(75)w = (57*10n–75)/99 facsup575.htm (maint. by P. De Geest). aba(5,7,n)=575...575 (n=1 to 100) (Hisanori Mishima) Free to factor    8 remaining 5(85)w = (58*10n–85)/99 facsup585.htm (maint. by P. De Geest). aba(5,8,n)=585...585 (n=1 to 100) (Hisanori Mishima) Free to factor    6 remaining 5(95)w = (59*10n–95)/99 facsup595.htm (maint. by P. De Geest). aba(5,9,n)=595...595 (n=1 to 100) (Hisanori Mishima) Free to factor    9 remaining 6(16)w = (61*10n–16)/99 facsup616.htm (maint. by P. De Geest). aba(6,1,n)=616...616 (n=1 to 100) (Hisanori Mishima) All factored (n ⩽ 100) 6(56)w = (65*10n–56)/99 facsup656.htm (maint. by P. De Geest). aba(6,5,n)=656...656 (n=1 to 100) (Hisanori Mishima) Free to factor    7 remaining 6(76)w = (67*10n–76)/99 facsup676.htm (maint. by P. De Geest). aba(6,7,n)=676...676 (n=1 to 100) (Hisanori Mishima) Free to factor    6 remaining 7(67)w = (76*10n–67)/99 facsup767.htm (maint. by P. De Geest). aba(7,6,n)=767...767 (n=1 to 100) (Hisanori Mishima) Free to factor    6 remaining 8(18)w = (81*10n–18)/99 facsup818.htm (maint. by P. De Geest). aba(8,1,n)=818...818 (n=1 to 100) (Hisanori Mishima) All factored (n ⩽ 100) 8(38)w = (83*10n–38)/99 facsup838.htm (maint. by P. De Geest). aba(8,3,n)=838...838 (n=1 to 100) (Hisanori Mishima) Free to factor    7 remaining 8(58)w = (85*10n–58)/99 facsup858.htm (maint. by P. De Geest). aba(8,5,n)=858...858 (n=1 to 100) (Hisanori Mishima) Free to factor    6 remaining 8(78)w = (87*10n–78)/99 facsup878.htm (maint. by P. De Geest). aba(8,7,n)=878...878 (n=1 to 100) (Hisanori Mishima) Free to factor    3 remaining 8(98)w = (89*10n–98)/99 facsup898.htm (maint. by P. De Geest). aba(8,9,n)=898...898 (n=1 to 100) (Hisanori Mishima) Free to factor    8 remaining

Following condition must be imposed that gcd(A,B) = 1 (in Factorization of ABA...ABA), i.e. A and B are coprime, since if A and B have a common factor > 1, then we can divide this factor from the number,
e.g. factor 69696...69696 is equivalent to factor 23232...23232.

```

```

The “SUPP” Table

 ¬ JH Feb 09 2001 PRIME View A062209 ¬A056803 ¬ The reference table forSmoothly Undulating Palindromic Primes This collection is complete forprobable primes up to 100,000 (ref. RC)digits and for proven primesup to  6343  digits. `CR = Carlos RiveraDB = David BroadhurstHR = Hans RosenthalJH = Jeffrey HeleenLN = Landon Curt NollPDG = Patrick De GeestRC = Ray Chandler` SUPP FormulaAccolades = prime expBlue exp = # of digits Who When Status ProgramOutput Logs 1(01)1 (10*10{3}–01)/99 IMPORTANT NOTE 1(21)3 (12*10{7}–21)/99 1(21)5 (12*10{11}–21)/99 1(21)21 (12*10{43}–21)/99 1(21)69 (12*10{139}–21)/99 1(21)313 (12*10627–21)/99 1(21)699 (12*10{1399}–21)/99 1(21)798 (12*10{1597}–21)/99 1(21)989 (12*10{1979}–21)/99 1(21)3904 (12*107809–21)/99 1(21)7029 (12*1014059–21)/99 1(21)23249 (12*10{46499}–21)/99 1(31)1 (13*10{3}–31)/99 1(31)12 (13*1025–31)/99 1(41)5 (14*10{11}–41)/99 1(41)138 (14*10{277}–41)/99 1(41)239 (14*10{479}–41)/99 1(41)291 (14*10583–41)/99 1(41)815 (14*101631–41)/99 1(41)3171 (14*10{6343}–41)/99 1(41)7344 (14*1014689–41)/99 1(51)1 (15*10{3}–51)/99 1(51)7 (15*1015–51)/99 1(51)31 (15*1063–51)/99 1(51)44 (15*10{89}–51)/99 1(51)122 (15*10245–51)/99 1(51)291 (15*10583–51)/99 1(51)895 (15*101791–51)/99 1(51)1061 (15*102123–51)/99 1(51)3616 (15*107233–51)/99 1(51)12393 (15*1024787–51)/99 1(51)22326 (15*1044653–51)/99 1(61)3 (16*10{7}–61)/99 1(61)27 (16*1055–61)/99 1(61)54 (16*10{109}–61)/99 1(61)72 (16*10145–61)/99 1(61)114 (16*10{229}–61)/99 1(61)480 (16*10961–61)/99 1(71)15 (17*10{31}–71)/99 1(71)18 (17*10{37}–71)/99 1(71)2442 (17*104885–71)/99 1(81)1 (18*10{3}–81)/99 1(81)2 (18*10{5}–81)/99 1(81)38 (18*1077–81)/99 1(81)81 (18*10{163}–81)/99 1(81)739 (18*101479–81)/99 1(81)1828 (18*103657–81)/99 1(81)2286 (18*104573–81)/99 1(81)4157 (18*108315–81)/99 1(81)15129 (18*10{30259}–81)/99 1(81)15531 (18*10{31063}–81)/99 1(81)15927 (18*1031855–81)/99 1(81)18457 (18*1036915–81)/99 1(81)33328 (18*1066657–81)/99 1(91)1 (19*10{3}–91)/99 1(91)16 (19*1033–91)/99 1(91)66 (19*10133–91)/99 1(91)984 (19*101969–91)/99 1(91)1167 (19*102335–91)/99 3(13)1 (31*10{3}–13)/99 3(13)25 (31*1051–13)/99 3(13)41 (31*10{83}–13)/99 3(13)112 (31*10225–13)/99 3(13)280 (31*10561–13)/99 3(13)5209 (31*1010419–13)/99 3(13)9127 (31*1018255–13)/99 3(13)21934 (31*1043869–13)/99 3(23)2 (32*10{5}–23)/99 3(23)4 (32*109–23)/99 3(23)5 (32*10{11}–23)/99 3(23)1507 (32*103015–23)/99 3(23)1703 (32*10{3407}–23)/99 3(23)3479 (32*10{6959}–23)/99 3(23)4799 (32*109599–23)/99 3(23)5699 (32*10{11399}–23)/99 3(23)8296 (32*1016593–23)/99 3(23)12941 (32*1025883–23)/99 3(43)w (34*10n–43)/99 3(53)1 (35*10{3}–53)/99 3(53)2 (35*10{5}–53)/99 3(53)11 (35*10{23}–53)/99 3(53)1088 (35*102177–53)/99 3(53)1573 (35*103147–53)/99 3(53)2078 (35*10{4157}–53)/99 3(53)11356 (35*1022713–53)/99 3(53)14192 (35*1028385–53)/99 3(73)1 (37*10{3}–73)/99 3(73)10 (37*1021–73)/99 3(73)13 (37*1027–73)/99 3(73)40 (37*1081–73)/99 3(73)157 (37*10315–73)/99 3(73)424 (37*10849–73)/99 3(73)946 (37*101893–73)/99 3(73)1441 (37*102883–73)/99 3(73)4795 (37*109591–73)/99 3(73)7345 (37*1014691–73)/99 3(83)1 (38*10{3}–83)/99 3(83)4 (38*109–83)/99 3(83)7 (38*1015–83)/99 3(83)8 (38*10{17}–83)/99 3(83)10 (38*1021–83)/99 3(83)28 (38*1057–83)/99 3(83)2116 (38*104233–83)/99 3(83)2167 (38*104335–83)/99 3(83)6610 (38*1013221–83)/99 3(83)13223 (38*1026447–83)/99 3(83)14948 (38*1029897–83)/99 3(83)45998 (38*10{91997}–83)/99 7(17)w (71*10n–17)/99 n ⩾ 100001 (PDG, September 13, 2004) 7(27)1 (72*10{3}–27)/99 7(27)2 (72*10{5}–27)/99 7(27)4 (72*109–27)/99 7(27)8 (72*10{17}–27)/99 7(27)35 (72*10{71}–27)/99 7(27)49 (72*1099–27)/99 7(27)121 (72*10243–27)/99 7(27)3797 (72*107595–27)/99 7(27)4636 (72*109273–27)/99 7(27)26923 (72*1053847–27)/99 7(37)7 (73*1015–37)/99 7(37)19 (73*1039–37)/99 7(37)283 (73*10567–37)/99 7(37)1264 (73*102529–37)/99 7(37)7168 (73*1014337–37)/99 7(47)2 (74*10{5}–47)/99 7(47)8 (74*10{17}–47)/99 7(47)1034 (74*10{2069}–47)/99 7(47)3407 (74*106815–47)/99 7(47)10208 (74*1020417–47)/99 7(47)12872 (74*1025745–47)/99 7(57)1 (75*10{3}–57)/99 7(57)8 (75*10{17}–57)/99 7(57)38 (75*1077–57)/99 7(57)71 (75*10143–57)/99 7(57)74 (75*10{149}–57)/99 7(57)256 (75*10513–57)/99 7(57)539 (75*101079–57)/99 7(57)707 (75*101415–57)/99 7(57)3124 (75*106249–57)/99 7(57)6632 (75*1013265–57)/99 7(57)7289 (75*1014579–57)/99 7(57)7646 (75*1015293–57)/99 7(57)20828 (75*1041657–57)/99 7(57)36470 (75*1072941–57)/99 7(87)1 (78*10{3}–87)/99 7(87)2 (78*10{5}–87)/99 7(87)10 (78*1021–87)/99 7(87)13 (78*1027–87)/99 7(87)47 (78*1095–87)/99 7(87)1037 (78*102075–87)/99 7(87)1082 (78*102165–87)/99 7(87)1523 (78*103047–87)/99 7(87)1751 (78*103503–87)/99 7(87)8395 (78*1016791–87)/99 7(87)17441 (78*10{34883}–87)/99 7(97)1 (79*10{3}–97)/99 7(97)178 (79*10357–97)/99 7(97)268 (79*10537–97)/99 7(97)838 (79*101677–97)/99 7(97)1528 (79*103057–97)/99 7(97)25831 (79*1051663–97)/99 7(97)33223 (79*1066447–97)/99 9(19)1 (91*10{3}–19)/99 9(19)4 (91*109–19)/99 9(19)5 (91*10{11}–19)/99 9(19)8 (91*10{17}–19)/99 9(19)11 (91*10{23}–19)/99 9(19)12614 (91*10{25229}–19)/99 9(29)1 (92*10{3}–29)/99 9(29)4 (92*109–29)/99 9(29)97 (92*10195–29)/99 9(29)257 (92*10515–29)/99 9(29)428 (92*10{857}–29)/99 9(29)5696 (92*10{11393}–29)/99 9(49)2 (94*10{5}–49)/99 9(49)8 (94*10{17}–49)/99 9(49)32 (94*1065–49)/99 9(49)71 (94*10143–49)/99 9(49)275 (94*10551–49)/99 9(49)46490 (94*1092981–49)/99 9(59)2 (95*10{5}–59)/99 9(59)8 (95*10{17}–59)/99 9(59)104 (95*10209–59)/99 9(59)647 (95*101295–59)/99 9(79)4 (97*109–79)/99 9(79)13 (97*1027–79)/99 9(79)22 (97*1045–79)/99 9(79)118 (97*10237–79)/99 9(89)4 (98*109–89)/99 9(89)80 (98*10161–89)/99 9(89)109 (98*10219–89)/99 9(89)2429 (98*104859–89)/99 9(89)10994 (98*1021989–89)/99 9(89)26465 (98*1052931–89)/99 9(89)44297 (98*1088595–89)/99
```

```

The “NSUP” Table

 The reference table forNear Smoothly Undulating PrimesCases with 2-digit undulatorsderived from the composite set of SUP's This collection is complete forprobable primes up to 30,000 digits. `PDG = Patrick De Geest` NSUP FormulaAccolades = prime exp Who When Status PrimeCertificat ¬ 2(12)1/22 = [53](03)0 (21*10{3}–12)/(99*4) PDG Aug 01 2022 PRP View 2(12)3/22 = [53](03)2 (21*10{7}–12)/(99*4) PDG Aug 01 2022 PRP View 2(12)10/22 = [53](03)9 (21*1021–12)/(99*4) PDG Aug 01 2022 PRP View 2(12)38/22 = [53](03)37 (21*1077–12)/(99*4) PDG Aug 01 2022 PRP View 2(12)51/22 = [53](03)50 (21*10{103}–12)/(99*4) PDG Aug 01 2022 PRP View 2(12)71/22 = [53](03)70 (21*10143–12)/(99*4) PDG Aug 01 2022 PRP View 2(12)260/22 = [53](03)259 (21*10{521}–12)/(99*4) PDG Aug 01 2022 PRP View 2(12)632/22 = [53](03)631 (21*101265–12)/(99*4) PDG Aug 01 2022 PRP View 2(12)673/22 = [53](03)672 (21*101347–12)/(99*4) PDG Aug 01 2022 PRP View 2(12)2508/22 = [53](03)2507 (21*105017–12)/(99*4) PDG Aug 01 2022 PRP View 2(12)4513/22 = [53](03)4512 (21*109027–12)/(99*4) PDG Aug 01 2022 PRP View 2(12)7868/22 = [53](03)7867 (21*10{15737}–12)/(99*4) PDG Aug 01 2022 PRP View ¬ 2(32)91/25 = [726](01)89 (23*10183–32)/(99*32) PDG Aug 01 2022 PRP View 2(32)721/25 = [726](01)719 (23*101443–32)/(99*32) PDG Aug 01 2022 PRP View 2(32)3000/25 = [726](01)2998 (23*106001–32)/(99*32) PDG Aug 01 2022 PRP View ¬ 2(52)5/22 = [63](13)4 (25*10{11}–52)/(99*4) PDG Aug 01 2022 PRP View 2(52)15/22 = [63](13)14 (25*10{31}–52)/(99*4) PDG Aug 01 2022 PRP View 2(52)42/22 = [63](13)41 (25*1085–52)/(99*4) PDG Aug 01 2022 PRP View 2(52)204/22 = [63](13)203 (25*10{409}–52)/(99*4) PDG Aug 01 2022 PRP View 2(52)702/22 = [63](13)701 (25*101405–52)/(99*4) PDG Aug 01 2022 PRP View ¬ 2(72)3/23 = [34](09)2 (27*10{7}–72)/(99*8) PDG Aug 01 2022 PRP View 2(72)12/23 = [34](09)11 (27*1025–72)/(99*8) PDG Aug 01 2022 PRP View 2(72)55/23 = [34](09)54 (27*10111–72)/(99*8) PDG Aug 01 2022 PRP View 2(72)2941/23 = [34](09)2940 (27*105883–72)/(99*8) PDG Aug 01 2022 PRP View 2(72)3853/23 = [34](09)3852 (27*107707–72)/(99*8) PDG Aug 01 2022 PRP View 2(72)8487/23 = [34](09)8486 (27*1016975–72)/(99*8) PDG Aug 01 2022 PRP View ¬ n ⩾ 67231 (PDG, August 8, 2022) 2(92)1/22 = [73](23)0 (29*10{3}–92)/(99*4) PDG Aug 01 2022 PRP View 2(92)3/22 = [73](23)2 (29*10{7}–92)/(99*4) PDG Aug 01 2022 PRP View 2(92)28/22 = [73](23)27 (29*1057–92)/(99*4) PDG Aug 01 2022 PRP View 2(92)226/22 = [73](23)225 (29*10453–92)/(99*4) PDG Aug 01 2022 PRP View ¬ 4(14)0/2 = [2](07)0 (41*101–14)/(99*2) PDG Aug 01 2022 PRP View 4(14)2/2 = [2](07)2 (41*10{5}–14)/(99*2) PDG Aug 01 2022 PRP View 4(14)129/2 = [2](07)129 (41*10259–14)/(99*2) PDG Aug 01 2022 PRP View 4(14)249/2 = [2](07)249 (41*10{499}–14)/(99*2) PDG Aug 01 2022 PRP View 4(14)315/2 = [2](07)315 (41*10{631}–14)/(99*2) PDG Aug 01 2022 PRP View 4(14)557/2 = [2](07)557 (41*101115–14)/(99*2) PDG Aug 01 2022 PRP View 4(14)615/2 = [2](07)615 (41*10{1231}–14)/(99*2) PDG Aug 01 2022 PRP View 4(14)965/2 = [2](07)965 (41*10{1931}–14)/(99*2) PDG Aug 01 2022 PRP View 4(14)4605/2 = [2](07)4605 (41*109211–14)/(99*2) PDG Aug 01 2022 PRP View ¬ 4(34)0/2 = [2](17)0 (43*101–34)/(99*2) PDG Aug 01 2022 PRP View 4(34)3/2 = [2](17)3 (43*10{7}–34)/(99*2) PDG Aug 01 2022 PRP View 4(34)6/2 = [2](17)6 (43*10{13}–34)/(99*2) PDG Aug 01 2022 PRP View 4(34)45/2 = [2](17)45 (43*1091–34)/(99*2) PDG Aug 01 2022 PRP View 4(34)48/2 = [2](17)48 (43*10{97}–34)/(99*2) PDG Aug 01 2022 PRP View 4(34)291/2 = [2](17)291 (43*10583–34)/(99*2) PDG Aug 01 2022 PRP View 4(34)2388/2 = [2](17)2388 (43*104777–34)/(99*2) PDG Aug 01 2022 PRP View ¬ 4(54)0/2 = [2](27)0 (45*101–54)/(99*2) PDG Aug 01 2022 PRP View 4(54)1/2 = [2](27)1 (45*10{3}–54)/(99*2) PDG Aug 01 2022 PRP View 4(54)2/2 = [2](27)2 (45*10{5}–54)/(99*2) PDG Aug 01 2022 PRP View 4(54)3/2 = [2](27)3 (45*10{7}–54)/(99*2) PDG Aug 01 2022 PRP View 4(54)8/2 = [2](27)8 (45*10{17}–54)/(99*2) PDG Aug 01 2022 PRP View 4(54)486/2 = [2](27)486 (45*10973–54)/(99*2) PDG Aug 01 2022 PRP View 4(54)497/2 = [2](27)497 (45*10995–54)/(99*2) PDG Aug 01 2022 PRP View 4(54)703/2 = [2](27)703 (45*101407–54)/(99*2) PDG Aug 01 2022 PRP View 4(54)14514/2 = [2](27)14514 (45*1029029–54)/(99*2) PDG Aug 01 2022 PRP View ¬ 4(74)0/2 = [2](37)0 (47*101–74)/(99*2) PDG Aug 01 2022 PRP View 4(74)57/2 = [2](37)57 (47*10115–74)/(99*2) PDG Aug 01 2022 PRP View ¬ 4(94)0/2 = [2](47)0 (49*101–94)/(99*2) PDG Aug 01 2022 PRP View 4(94)336/2 = [2](47)336 (49*10{673}–94)/(99*2) PDG Aug 01 2022 PRP View 4(94)396/2 = [2](47)396 (49*10793–94)/(99*2) PDG Aug 01 2022 PRP View ¬ 5(15)0/5 = [1](03)0 (51*101–15)/(99*5) PDG Aug 01 2022 PRP View 5(15)1/5 = [1](03)1 (51*10{3}–15)/(99*5) PDG Aug 01 2022 PRP View 5(15)2/5 = [1](03)2 (51*10{5}–15)/(99*5) PDG Aug 01 2022 PRP View 5(15)4/5 = [1](03)4 (51*109–15)/(99*5) PDG Aug 01 2022 PRP View 5(15)9/5 = [1](03)9 (51*10{19}–15)/(99*5) PDG Aug 01 2022 PRP View 5(15)22/5 = [1](03)22 (51*1045–15)/(99*5) PDG Aug 01 2022 PRP View 5(15)28/5 = [1](03)28 (51*1057–15)/(99*5) PDG Aug 01 2022 PRP View 5(15)39/5 = [1](03)39 (51*10{79}–15)/(99*5) PDG Aug 01 2022 PRP View 5(15)96/5 = [1](03)96 (51*10{193}–15)/(99*5) PDG Aug 01 2022 PRP View 5(15)138/5 = [1](03)138 (51*10{277}–15)/(99*5) PDG Aug 01 2022 PRP View 5(15)1532/5 = [1](03)1532 (51*103065–15)/(99*5) PDG Aug 01 2022 PRP View 5(15)1553/5 = [1](03)1553 (51*103107–15)/(99*5) PDG Aug 01 2022 PRP View 5(15)3022/5 = [1](03)3022 (51*106045–15)/(99*5) PDG Aug 01 2022 PRP View 5(15)3325/5 = [1](03)3325 (51*106651–15)/(99*5) PDG Aug 01 2022 PRP View 5(15)9888/5 = [1](03)9888 (51*10{19777}–15)/(99*5) PDG Aug 01 2022 PRP View ¬ 5(25)3/52 = [21](01)2 (52*10{7}–25)/(99*25) PDG Aug 01 2022 PRP View 5(25)18/52 = [21](01)17 (52*10{37}–25)/(99*25) PDG Aug 01 2022 PRP View 5(25)170/52 = [21](01)169 (52*10341–25)/(99*25) PDG Aug 01 2022 PRP View 5(25)227/52 = [21](01)226 (52*10455–25)/(99*25) PDG Aug 01 2022 PRP View 5(25)3086/52 = [21](01)3085 (52*10{6173}–25)/(99*25) PDG Aug 01 2022 PRP View 5(25)5840/52 = [21](01)5839 (52*10{11681}–25)/(99*25) PDG Aug 01 2022 PRP View ¬ 5(35)1/5 = [1](07)1 (53*10{3}–35)/(99*5) PDG Aug 01 2022 PRP View 5(35)4/5 = [1](07)4 (53*109–35)/(99*5) PDG Aug 01 2022 PRP View 5(35)6/5 = [1](07)6 (53*10{13}–35)/(99*5) PDG Aug 01 2022 PRP View 5(35)34/5 = [1](07)34 (53*1069–35)/(99*5) PDG Aug 01 2022 PRP View 5(35)1563/5 = [1](07)1563 (53*103127–35)/(99*5) PDG Aug 01 2022 PRP View ¬ 5(45)0/5 = [1](09)0 (54*101–45)/(99*5) PDG Aug 01 2022 PRP View 5(45)1/5 = [1](09)1 (54*10{3}–45)/(99*5) PDG Aug 01 2022 PRP View 5(45)2/5 = [1](09)2 (54*10{5}–45)/(99*5) PDG Aug 01 2022 PRP View 5(45)3/5 = [1](09)3 (54*10{7}–45)/(99*5) PDG Aug 01 2022 PRP View 5(45)5/5 = [1](09)5 (54*10{11}–45)/(99*5) PDG Aug 01 2022 PRP View 5(45)12/5 = [1](09)12 (54*1025–45)/(99*5) PDG Aug 01 2022 PRP View 5(45)716/5 = [1](09)716 (54*10{1433}–45)/(99*5) PDG Aug 01 2022 PRP View 5(45)2867/5 = [1](09)2867 (54*105735–45)/(99*5) PDG Aug 01 2022 PRP View 5(45)5738/5 = [1](09)5738 (54*1011477–45)/(99*5) PDG Aug 01 2022 PRP View ¬ 5(65)0/5 = [1](13)0 (56*101–65)/(99*5) PDG Aug 01 2022 PRP View 5(65)1/5 = [1](13)1 (56*10{3}–65)/(99*5) PDG Aug 01 2022 PRP View 5(65)6/5 = [1](13)6 (56*10{13}–65)/(99*5) PDG Aug 01 2022 PRP View 5(65)10/5 = [1](13)10 (56*1021–65)/(99*5) PDG Aug 01 2022 PRP View 5(65)810/5 = [1](13)810 (56*10{1621}–65)/(99*5) PDG Aug 01 2022 PRP View ¬ 5(75)1/52 = [23](03)0 (57*10{3}–75)/(99*25) PDG Aug 01 2022 PRP View 5(75)3/52 = [23](03)2 (57*10{7}–75)/(99*25) PDG Aug 01 2022 PRP View 5(75)7/52 = [23](03)6 (57*1015–75)/(99*25) PDG Aug 01 2022 PRP View 5(75)21/52 = [23](03)20 (57*10{43}–75)/(99*25) PDG Aug 01 2022 PRP View 5(75)40/52 = [23](03)39 (57*1081–75)/(99*25) PDG Aug 01 2022 PRP View 5(75)60/52 = [23](03)59 (57*10121–75)/(99*25) PDG Aug 01 2022 PRP View 5(75)73/52 = [23](03)72 (57*10147–75)/(99*25) PDG Aug 01 2022 PRP View 5(75)571/52 = [23](03)570 (57*101143–75)/(99*25) PDG Aug 01 2022 PRP View 5(75)783/52 = [23](03)782 (57*10{1567}–75)/(99*25) PDG Aug 01 2022 PRP View 5(75)2980/52 = [23](03)2979 (57*105961–75)/(99*25) PDG Aug 01 2022 PRP View ¬ 5(85)0/5 = [1](17)0 (58*101–85)/(99*5) PDG Aug 01 2022 PRP View 5(85)2/5 = [1](17)2 (58*10{5}–85)/(99*5) PDG Aug 01 2022 PRP View 5(85)6/5 = [1](17)6 (58*10{13}–85)/(99*5) PDG Aug 01 2022 PRP View 5(85)12/5 = [1](17)12 (58*1025–85)/(99*5) PDG Aug 01 2022 PRP View 5(85)33/5 = [1](17)33 (58*10{67}–85)/(99*5) PDG Aug 01 2022 PRP View 5(85)90/5 = [1](17)90 (58*10{181}–85)/(99*5) PDG Aug 01 2022 PRP View 5(85)1262/5 = [1](17)1262 (58*102525–85)/(99*5) PDG Aug 01 2022 PRP View 5(85)6872/5 = [1](17)6872 (58*1013745–85)/(99*5) PDG Aug 01 2022 PRP View 5(85)10365/5 = [1](17)10365 (58*10{20731}–85)/(99*5) PDG Aug 01 2022 PRP View 5(85)13665/5 = [1](17)13665 (58*1027331–85)/(99*5) PDG Aug 01 2022 PRP View ¬ 5(95)0/5 = [1](19)0 (59*101–95)/(99*5) PDG Aug 01 2022 PRP View 5(95)24/5 = [1](19)24 (59*1049–95)/(99*5) PDG Aug 01 2022 PRP View 5(95)381/5 = [1](19)381 (59*10763–95)/(99*5) PDG Aug 01 2022 PRP View 5(95)9741/5 = [1](19)9741 (59*10{19483}–95)/(99*5) PDG Aug 01 2022 PRP View ¬ 6(16)2/24 = [3851](01)0 (61*10{5}–16)/(99*16) PDG Aug 01 2022 PRP View 6(16)5/24 = [3851](01)3 (61*10{11}–16)/(99*16) PDG Aug 01 2022 PRP View 6(16)62/24 = [3851](01)60 (61*10125–16)/(99*16) PDG Aug 01 2022 PRP View 6(16)926/24 = [3851](01)924 (61*101853–16)/(99*16) PDG Aug 01 2022 PRP View ¬ 6(56)4/23 = [82](07)3 (65*109–56)/(99*8) PDG Aug 01 2022 PRP View 6(56)10/23 = [82](07)9 (65*1021–56)/(99*8) PDG Aug 01 2022 PRP View 6(56)13/23 = [82](07)12 (65*1027–56)/(99*8) PDG Aug 01 2022 PRP View 6(56)37/23 = [82](07)36 (65*1075–56)/(99*8) PDG Aug 01 2022 PRP View 6(56)3047/23 = [82](07)3046 (65*106095–56)/(99*8) PDG Aug 01 2022 PRP View ¬ 8(18)1/2 = [4](09)1 (81*10{3}–18)/(99*2) PDG Aug 01 2022 PRP View 8(18)7/2 = [4](09)7 (81*1015–18)/(99*2) PDG Aug 01 2022 PRP View 8(18)14/2 = [4](09)14 (81*10{29}–18)/(99*2) PDG Aug 01 2022 PRP View 8(18)58/2 = [4](09)58 (81*10117–18)/(99*2) PDG Aug 01 2022 PRP View 8(18)143/2 = [4](09)143 (81*10287–18)/(99*2) PDG Aug 01 2022 PRP View 8(18)383/2 = [4](09)383 (81*10767–18)/(99*2) PDG Aug 01 2022 PRP View 8(18)488/2 = [4](09)488 (81*10{977}–18)/(99*2) PDG Aug 01 2022 PRP View 8(18)499/2 = [4](09)499 (81*10999–18)/(99*2) PDG Aug 01 2022 PRP View 8(18)1203/2 = [4](09)1203 (81*102407–18)/(99*2) PDG Aug 01 2022 PRP View 8(18)8754/2 = [4](09)8754 (81*10{17509}–18)/(99*2) PDG Aug 01 2022 PRP View 8(18)11708/2 = [4](09)11708 (81*10{23417}–18)/(99*2) PDG Aug 01 2022 PRP View ¬ 8(38)1/2 = [4](19)1 (83*10{3}–38)/(99*2) PDG Aug 01 2022 PRP View 8(38)3/2 = [4](19)3 (83*10{7}–38)/(99*2) PDG Aug 01 2022 PRP View 8(38)43/2 = [4](19)43 (83*1087–38)/(99*2) PDG Aug 01 2022 PRP View 8(38)87/2 = [4](19)87 (83*10175–38)/(99*2) PDG Aug 01 2022 PRP View 8(38)811/2 = [4](19)811 (83*101623–38)/(99*2) PDG Aug 01 2022 PRP View 8(38)979/2 = [4](19)979 (83*101959–38)/(99*2) PDG Aug 01 2022 PRP View 8(38)13372/2 = [4](19)13372 (83*1026745–38)/(99*2) PDG Aug 01 2022 PRP View ¬ 8(58)2/2 = [4](29)2 (85*10{5}–58)/(99*2) PDG Aug 01 2022 PRP View 8(58)6/2 = [4](29)6 (85*10{13}–58)/(99*2) PDG Aug 01 2022 PRP View 8(58)90/2 = [4](29)90 (85*10{181}–58)/(99*2) PDG Aug 01 2022 PRP View 8(58)98/2 = [4](29)98 (85*10{197}–58)/(99*2) PDG Aug 01 2022 PRP View 8(58)141/2 = [4](29)141 (85*10{283}–58)/(99*2) PDG Aug 01 2022 PRP View 8(58)443/2 = [4](29)443 (85*10{887}–58)/(99*2) PDG Aug 01 2022 PRP View 8(58)560/2 = [4](29)560 (85*101121–58)/(99*2) PDG Aug 01 2022 PRP View 8(58)689/2 = [4](29)689 (85*101379–58)/(99*2) PDG Aug 01 2022 PRP View 8(58)11393/2 = [4](29)11393 (85*10{22787}–58)/(99*2) PDG Aug 01 2022 PRP View ¬ 8(78)1/2 = [4](39)1 (87*10{3}–78)/(99*2) PDG Aug 01 2022 PRP View 8(78)10/2 = [4](39)10 (87*1021–78)/(99*2) PDG Aug 01 2022 PRP View 8(78)16/2 = [4](39)16 (87*1033–78)/(99*2) PDG Aug 01 2022 PRP View 8(78)37/2 = [4](39)37 (87*1075–78)/(99*2) PDG Aug 01 2022 PRP View 8(78)132/2 = [4](39)132 (87*10265–78)/(99*2) PDG Aug 01 2022 PRP View 8(78)150/2 = [4](39)150 (87*10301–78)/(99*2) PDG Aug 01 2022 PRP View 8(78)2716/2 = [4](39)2716 (87*105433–78)/(99*2) PDG Aug 01 2022 PRP View 8(78)9922/2 = [4](39)9922 (87*1019845–78)/(99*2) PDG Aug 01 2022 PRP View 8(78)11370/2 = [4](39)11370 (87*10{22741}–78)/(99*2) PDG Aug 01 2022 PRP View ¬ 8(98)1/2 = [4](49)1 (89*10{3}–98)/(99*2) PDG Aug 01 2022 PRP View 8(98)21/2 = [4](49)21 (89*10{43}–98)/(99*2) PDG Aug 01 2022 PRP View 8(98)28/2 = [4](49)28 (89*1057–98)/(99*2) PDG Aug 01 2022 PRP View 8(98)43/2 = [4](49)43 (89*1087–98)/(99*2) PDG Aug 01 2022 PRP View 8(98)169/2 = [4](49)169 (89*10339–98)/(99*2) PDG Aug 01 2022 PRP View 8(98)201/2 = [4](49)201 (89*10403–98)/(99*2) PDG Aug 01 2022 PRP View 8(98)210/2 = [4](49)210 (89*10{421}–98)/(99*2) PDG Aug 01 2022 PRP View 8(98)298/2 = [4](49)298 (89*10597–98)/(99*2) PDG Aug 01 2022 PRP View 8(98)1948/2 = [4](49)1948 (89*103897–98)/(99*2) PDG Aug 01 2022 PRP View 8(98)3351/2 = [4](49)3351 (89*10{6703}–98)/(99*2) PDG Aug 01 2022 PRP View 8(98)13213/2 = [4](49)13213 (89*1026427–98)/(99*2) PDG Aug 01 2022 PRP View

```

```

Sources Revealed

 Neil Sloane's "Integer Sequences" Encyclopedia can be consulted online : Neil Sloane's Integer Sequences Various undulating numbers, primes and palindromic primes are categorised as follows : %N Undulating squares. under A016073 %N Undulating primes (digits alternate). under A032758 %N Undulating numbers (of form abababab... in base 10). under A033619 %N Undulating palindromic primes of form [AB]nA with        alternating prime and nonprime digits. under A039944 %N Non-trivial undulants; base 10 numbers >100 which are of the form        aba, abab, ababa..., where a!=b. under A046075 %N Indices of binary undulants; numbers n such that 2^n contains the        alternating sequence of digits 010... or 101... under A046076 %N a(d-2) is the smallest member of A046076 containing an undulating        sequence of 010... or 101... of maximal length d=3, 4, ... under A046077 %N Palindromic primes with just two distinct digits. under A056730 %N Numbers of (2n+1)-digit palindromic primes that undulate. under A057332 %N Numbers of n-digit primes that undulate. under A057333 %N Palindromic primes with just two distinct prime digits. under A058375 %N Primes in which digits alternately rise and fall (or vice versa);        sometimes called undulating primes. under A059168 %N Strictly undulating primes (digits alternate and differ by 1). under A059170 %N Undulating palindromic primes: numbers that are prime, palindromic        in base 10, and the digits alternate: ababab... with a != b. under A059758 %N Smoothly undulating palindromic primes of the general form        (ab*10^m-ba)/99 exist for digitlengths a(n). under A077799 Click here to view some of the author's [P. De Geest] entries to the table. Click here to view some entries to the table about palindromes.

Prime Curios! - site maintained by G. L. Honaker Jr. and Chris Caldwell
7
101
131
151
181
191
264
313
353
373
383
727
757
787
797
919
929
12121 smoothly undulating composite
69696 smoothly undulating composite
72727
78787
94949
1212121
696969696 smoothly undulating composite
919191919
906343609
12121212121
151515151515151
74747474747474747
35353535353535353535353
13131...13131 (25-digits)
17171...17171 (31-digits)
19191...19191 (33-digits)
17171...17171 (37-digits)
73737...73737 (39-digits)
12121...12121 (43-digits)
18181...18181 (77-digits)
12121...12121 (139-digits)
16161...16161 (229-digits)
72727...72727 (243-digits)
37373...37373 (2883-digits)
32323...32323 (3407-digits)
35353...35353 (4157-digits)
98989...98989 (4859-digits)
17171...17171 (4885-digits)
75757...75757 (6249-digits)
14141...14141 (6343-digits)
32323...32323 (6959-digits)

Clifford A. Pickover's book “Keys to Infinity”.
contains a chapter about these undulating primes (Chapter 20, pages 159 to 161),
titled “The Undulation of the Monks”. The last alinea is in fact an appeal to the public:
.
I am interested in hearing from readers who have searched for undulating primes
with larger periods of undulation, such as found in the prime number 5,995,995,995
(which does not finish its last cycle of undulation).
.
Well, I am interested as well !

All of Hans Rosenthal's probable primes above 10000 digits are also
submitted to the PRP TOP records table maintained by Henri & Renaud Lifchitz.

```

```