Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064029
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A064029 Numbers n such that sopfr(n) = ud(n), where sopfr = A001414 and ud(n) = A034444. +0
1
2, 5460, 9240, 253890, 358050, 387090, 395850, 429660, 440895, 458850, 468930, 475020, 529074, 550620, 574770, 629850, 669900, 755820, 788970 (list; graph; listen)
OFFSET

1,1

PROGRAM

(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: A067668 A153737 A078933 this_sequence A057645 A129060 A099690

Adjacent sequences: A064026 A064027 A064028 this_sequence A064030 A064031 A064032

KEYWORD

more,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Sep 12 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research