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.

Showing 1-1 of 1 results.

A046366 Composite numbers divisible by the palindromic sum of their palindromic prime factors (counted with multiplicity).

Original entry on oeis.org

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
Offset: 1

Views

Author

Patrick De Geest, Jun 15 1998

Keywords

Comments

The subsequence of numbers k of A046355 such that A262049(k) divides k. - R. J. Mathar, Sep 09 2015

Examples

			1041714 = 2 * 3^3 * 101 * 191 -> Sum of factors is 303 -> 1041714 / 303 = 3438 exactly.
		

Crossrefs

Cf. A046367.

Programs

  • 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 *)
Showing 1-1 of 1 results.