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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064029 Numbers n such that sopfr(n) = ud(n), where sopfr = A001414 and ud(n) = A034444. 0
2, 5460, 9240, 253890, 358050, 387090, 395850, 429660, 440895, 458850, 468930, 475020, 529074, 550620, 574770, 629850, 669900, 755820, 788970 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

PROG

(PARI) sopfr(n, s, fac, i) = fac=factor(n); for(i=1, matsize(fac)[1], s=s+fac[i, 1]*fac[i, 2]); return(s); ud(n) = 2^omega(n); for(n=1, 10^6, if(sopfr(n)==ud(n), print(n)))

CROSSREFS

Sequence in context: A262059 A153737 A078933 * A057645 A129060 A190127

Adjacent sequences:  A064026 A064027 A064028 * A064030 A064031 A064032

KEYWORD

more,nonn

AUTHOR

Jason Earls, Sep 12 2001

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 23 22:18 EDT 2019. Contains 325269 sequences. (Running on oeis4.)