This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A046366 Composite numbers divisible by the palindromic sum of their palindromic prime factors (counted with multiplicity). 2
 4, 16, 27, 308, 440, 528, 594, 5445, 5808, 6534, 8085, 9702, 11550, 13860, 14784, 16500, 16632, 18711, 19800, 21120, 22275, 23760, 25344, 26730, 28512, 32076, 37268, 53240, 63888, 94864, 135520, 152460, 162624, 181500, 182952, 193600 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The subsequence of numbers k of A046355 such that A262049(k) divides k. - R. J. Mathar, Sep 09 2015 LINKS Giovanni Resta, Table of n, a(n) for n = 1..1387 (terms < 10^10) EXAMPLE 1041714 = 2 * 3^3 * 101 * 191 -> Sum of factors is 303 -> 1041714 / 303 = 3438 exactly. MAPLE isA046366 := proc(n)     local sofpp ;     if isA046355(n) then         sofpp := A262049(n) ;         if modp(n, sofpp) = 0 then             true;         else             false;         end if;     else         false;     end if; end proc: for n from 2 to 1000 do     if isA046366(n) then         printf("%d, ", n) ;     end if; end do: # R. J. Mathar, Sep 09 2015 MATHEMATICA palQ[n_]:=Reverse[x=IntegerDigits[n]]==x; Select[Range[4, 10^5], !PrimeQ[#]&&And@@palQ/@Join[{y=Total[Times@@@(x=FactorInteger[#])]}, First/@x]&&IntegerQ[#/y]&](* Jayanta Basu, Jun 05 2013 *) CROSSREFS Cf. A046367. Sequence in context: A257309 A271936 A046358 * A227609 A219338 A275211 Adjacent sequences:  A046363 A046364 A046365 * A046367 A046368 A046369 KEYWORD nonn,base,changed AUTHOR Patrick De Geest, Jun 15 1998 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.

Last modified October 14 14:45 EDT 2019. Contains 328019 sequences. (Running on oeis4.)