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!)
A327435 a(n) is the largest (2n+1)-digit palindrome that is the product of two numbers having an equal number of digits. 2
9, 999, 99999, 9999999, 999969999, 99999999999, 9999998999999, 999999999999999, 99999999799999999, 9999999997999999999, 999999999999999999999, 99999999999899999999999, 9999999999999999999999999, 999999999999979999999999999, 99999999999999999999999999999, 9999999999999996999999999999999 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
A308803 is the union of this sequence and A327897. This sequence lists the terms of odd indices of A308803 as they seem to be easier to compute than terms of even indices of A308803 (the sequence A327897).
LINKS
FORMULA
a(n) = A308803(2n+1).
a(n) >= (2*10^n-1)(5*10^n+1) = 10^(2n+1)-3*10^n-1. If n is a term of A308983, then a(n) = 10^(2n+1)-3*10^n-1.
EXAMPLE
a(0) = 9 = 3 * 3
a(1) = 999 = 27 * 37
a(2) = 99999 = 123 * 813
a(3) = 9999999 = 2151 * 4649
a(4) = 999969999 = 16667 * 59997
a(5) = 99999999999 = 194841 * 513239
a(6) = 9999998999999 = 2893921 * 3455519
a(7) = 999999999999999 = 11099889 * 90090991
a(8) = 99999999799999999 = 265412903 * 376771433
a(9) = 9999999997999999999 = 2441330309 * 4096127411
a(10) = 999999999999999999999 = 19845575559 * 50389065161
a(11) = 99999999999899999999999 = 345867517613 * 289128047323
CROSSREFS
Sequence in context: A112909 A083909 A307324 * A350967 A100601 A260029
KEYWORD
nonn,base
AUTHOR
Chai Wah Wu, Oct 03 2019
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 14:38 EDT 2024. Contains 371254 sequences. (Running on oeis4.)