OFFSET
1,2
COMMENTS
Beginning with 132, it appears that all entries are congruent mod 11*12; 11 to produce palindromic divisors and 12 for numerous divisors. - Robert G. Wilson v, May 14 2004
The number of palindromic divisors of a(n) are 1, 2, 3, 4, 5, 6, 8, 10, 12, 14, 15, 16, 19, 20, 21, 22, 24, 27, 28, 29, 30, 33, 37, 39, 43, 50, 52, 54, 57, 59, 61, 68, 72, 80, 90.
Every term is of the form Product_{i>=1} A226732(i)^e(i) for e(i) >= 0. - David A. Corneth, Jan 10 2021
REFERENCES
Jason Earls, "Palindions," Mathematical Bliss, Pleroma Publications, 2009, pages 115-120. ASIN: B002ACVZ6O. [From Jason Earls, Nov 25 2009]
LINKS
David A. Corneth, Conjectured next terms
MATHEMATICA
palindromicQ[n_, b_:10] := If[FromDigits[Reverse[IntegerDigits[n, b]], b] == n, True, False]; a = 0; Do[c = Count[palindromicQ[ # ] & /@ Divisors[n], True]; If[c > a, Print[n]; a = c], {n, 300000000}] (* Robert G. Wilson v, May 14 2004 with a small modification from Alonso del Arte to permit reuse in many other sequences' programs *)
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Jason Earls, May 08 2004
EXTENSIONS
Edited and extended by Robert G. Wilson v, May 14 2004
a(35)-a(36) from Chai Wah Wu, Jan 21 2021
STATUS
approved