Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063891
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063891 z(usigma(n)) = 2n, where z(n) = A048146. +0
1
1631, 2016, 8928, 11808, 36576, 45360, 1486080, 2359008, 3093552, 37748448 (list; graph; listen)
OFFSET

1,1

PROGRAM

(PARI) u(n) = sumdiv(n, d, if(gcd(d, n/d)==1, d)); z(n)=sigma(n)-u(n) for(n=1, 10^8, if(z(u(n))==2*n, print(n)))

CROSSREFS

Cf. A000203, A034448, A048146, A019284, A063885.

Sequence in context: A022060 A107524 A097225 this_sequence A072409 A052455 A054808

Adjacent sequences: A063888 A063889 A063890 this_sequence A063892 A063893 A063894

KEYWORD

more,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Aug 28 2001

EXTENSIONS

More terms from Thomas Baruchel (baruchel(AT)users.sourceforge.net), Oct 22 2003

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 September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research