A strictly non-palindromic number is a natural number that is not a number palindrome in any place value system , the basis of which is in the range .



The upper limit on the size of the base is necessary to keep the sequence nontrivial, since

- each number (greater than 1) is written as a single-digit (also palindromic) number for each base ;


- every number (greater than 2) to the base is written as , i.e. non-palindromic;



- every number (greater than 3) to the base is written as (palindromic).



For the set of bases is empty, so these numbers are trivially also strictly non-palindromic.

Examples
For example, the (decimal) number 6 is written
- to base two: 110,
- to base three: 20 and
- to base four: 12
Since none of these spellings are palindromic, 6 is strictly non-palindromic.
The sequence of strictly non-palindromic numbers begins with
- 0, 1, 2, 3, 4, 6, 11, 19, 47, 53, 79, 103, 137, 139, 149, 163, 167, 179, 223, 263, 269, 283, 293, ...
properties
All strictly non-palindromic numbers greater than 6 are prime numbers . For every composite number , a base can be found that is palindromic.


proof
- If is even , then the base is written as 22 (palindromic).


- Otherwise is odd and can be written as , where the smallest prime factor is. Understandably then .




-
- If then , then is what is written for base 2 as 1001 (palindromic).


- If then , the base is written as 121 (palindromic).



- Otherwise is . The case cannot occur because both and are odd.




- In this case, the two-digit number (palindromic) is written to the base .



In each of these cases the base is in the range .


Individual evidence
-
↑ Follow A016038 in OEIS
|
|
formula based
|
Carol ((2 n - 1) 2 - 2) |
Cullen ( n ⋅2 n + 1) |
Double Mersenne (2 2 p - 1 - 1) |
Euclid ( p n # + 1) |
Factorial ( n! ± 1) |
Fermat (2 2 n + 1) |
Cubic ( x 3 - y 3 ) / ( x - y ) |
Kynea ((2 n + 1) 2 - 2) |
Leyland ( x y + y x ) |
Mersenne (2 p - 1) |
Mills ( A 3 n ) |
Pierpont (2 u ⋅3 v + 1) |
Primorial ( p n # ± 1) |
Proth ( k ⋅2 n + 1) |
Pythagorean (4 n + 1) |
Quartic ( x 4 + y 4 ) |
Thabit (3⋅2 n - 1) |
Wagstaff ((2 p + 1) / 3) |
Williams (( b-1 ) ⋅ b n - 1)
Woodall ( n ⋅2 n - 1)
|
Prime number follow
|
Bell |
Fibonacci |
Lucas |
Motzkin |
Pell |
Perrin
|
property-based
|
Elitist |
Fortunate |
Good |
Happy |
Higgs |
High quotient |
Isolated |
Pillai |
Ramanujan |
Regular |
Strong |
Star |
Wall – Sun – Sun |
Wieferich |
Wilson
|
base dependent
|
Belphegor |
Champernowne |
Dihedral |
Unique |
Happy |
Keith |
Long |
Minimal |
Mirp |
Permutable |
Primeval |
Palindrome |
Repunit ((10 n - 1) / 9) |
Weak |
Smarandache – Wellin |
Strictly non-palindromic |
Strobogrammatic |
Tetradic |
Trunkable |
circular
|
based on tuples
|
Balanced ( p - n , p , p + n) |
Chen |
Cousin ( p , p + 4) |
Cunningham ( p , 2 p ± 1, ...) |
Triplet ( p , p + 2 or p + 4, p + 6) |
Constellation |
Sexy ( p , p + 6) |
Safe ( p , ( p - 1) / 2) |
Sophie Germain ( p , 2 p + 1) |
Quadruplets ( p , p + 2, p + 6, p + 8) |
Twin ( p , p + 2) |
Twin bi-chain ( n ± 1, 2 n ± 1, ...)
|
according to size
|
Titanic (1,000+ digits) |
Gigantic (10,000+ digits) |
Mega (1,000,000+ digits) |
Beva (1,000,000,000+ positions)
|
Composed
|
Carmichael |
Euler's pseudo |
Almost |
Fermatsche pseudo |
Pseudo |
Semi |
Strong pseudo |
Super Euler's pseudo
|