login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A323742 a(n) is the smallest number that is a (2n+1)-digit palindrome in three consecutive integer bases, or 0 if no such number exists. 1
178, 154593982, 3360633, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

It is conjectured that a(n)=0 for all n>=4. - Matej Veselovac, Mar 25 2020

LINKS

Table of n, a(n) for n=1..6.

Max Alekseyev, Generalized system and related problems, Math Stack Exchange, Oct 06 2019

EXAMPLE

a(1)=178 is the smallest number that is a 3-digit palindrome in three consecutive integer bases: 178 = 454_6 = 343_7 = 262_8.

a(2)=154593982 is the smallest number that is a 5-digit palindrome in three consecutive integer bases: 154593982 = (37,31,22,31,37)_45 = (34,24,11,24,34)_46 = (31,32,0,32,31)_47.

a(3)=3360633 is the smallest number that is a 7-digit palindrome in three consecutive integer bases: 3360633 = 6281826_9 = 3360633_10 = 1995991_11.

CROSSREFS

Cf. A279093, A327810.

Sequence in context: A189440 A163730 A157842 * A273550 A053017 A140026

Adjacent sequences:  A323739 A323740 A323741 * A323743 A323744 A323745

KEYWORD

nonn,base,hard,more

AUTHOR

Jon E. Schoenfield, Mar 24 2019

EXTENSIONS

a(4)-a(6) from Max Alekseyev, Jun 14 2020

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 16 18:07 EST 2022. Contains 350376 sequences. (Running on oeis4.)