cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A046348 Composite palindromes divisible by the sum of their prime factors (counted with multiplicity).

This page as a plain text file.
%I A046348 #32 Jul 20 2025 07:34:43
%S A046348 4,646,2772,5445,8778,30303,48384,50505,54145,63336,77077,117711,
%T A046348 219912,234432,239932,255552,272272,294492,535535,585585,636636,
%U A046348 717717,825528,888888,951159,999999,1103011,1112111,1345431,2248422,2267622
%N A046348 Composite palindromes divisible by the sum of their prime factors (counted with multiplicity).
%H A046348 David A. Corneth, <a href="/A046348/b046348.txt">Table of n, a(n) for n = 1..4180</a> (Terms <= 10^15. First 1000 terms from R. J. Mathar and Giovanni Resta)
%H A046348 David A. Corneth, <a href="/A046348/a046348.gp.txt">PARI prog</a>
%e A046348 a(2)=646 :  2*17*19 -> 2 + 17 + 19 = 38 and 646 / 38 = 17.
%t A046348 t={}; Do[If[!PrimeQ[n]&&Reverse[x=IntegerDigits[n]]==x&&IntegerQ[n/Total[Times@@@FactorInteger[n]]],AppendTo[t,n]],{n,4,2.5*10^6}]; t (* _Jayanta Basu_, Jun 04 2013 *)
%t A046348 cpdQ[n_]:=CompositeQ[n]&&PalindromeQ[n]&&Divisible[n,Total[ Flatten[ Table[ #[[1]],#[[2]]]&/@FactorInteger[n]]]]; Select[Range[23*10^5],cpdQ] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, May 01 2018 *)
%o A046348 (PARI) See PARI link.
%Y A046348 Cf. A032350, A001414, A046346, A046347.
%K A046348 nonn,base
%O A046348 1,1
%A A046348 _Patrick De Geest_, Jun 15 1998