login
This site is supported by donations to The OEIS Foundation.

 

Logo

Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A212863 Numbers n such that the sum of prime factors of n (counted with multiplicity) equals five times the largest prime divisor. 0
32, 192, 216, 243, 3125, 3750, 4000, 4500, 4800, 5120, 5400, 5760, 6075, 6480, 7290, 16807, 24010, 28812, 34300, 41160, 43904, 46305, 49000, 49392, 55125, 55566, 58800, 62720, 65625, 66150, 70000, 70560, 75264, 78750, 79380, 84000, 84672, 89600, 94500, 95256 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

The numbers prime(n)^5 are in the sequence.

LINKS

Table of n, a(n) for n=1..40.

EXAMPLE

192 is in the sequence because 192 = 2^6 * 3 => sum of prime divisors = 2*6 + 3 = 15 = 5*3 where 3 is the greatest prime divisor.

MAPLE

with(numtheory):A:= proc(n) local e, j; e := ifactors(n)[2]: add (e[j][1]*e[j][2], j=1..nops(e)) end: for m from 2 to 500000 do: x:=factorset(m):n1:=nops(x):if A(m)=5*x[n1] then printf(`%d, `, m):else fi:od:

CROSSREFS

Cf. A001414, A163836, A212861, A212862.

Sequence in context: A233387 A200840 A208925 * A019560 A130811 A232051

Adjacent sequences:  A212860 A212861 A212862 * A212864 A212865 A212866

KEYWORD

nonn

AUTHOR

Michel Lagneau, May 29 2012

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified April 17 09:16 EDT 2014. Contains 240634 sequences.