Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063085
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063085 usigma(n) - (phi(n)+d(n)), where usigma(n) is the sum of the unitary divisors of n and d(n) is the number of divisors of n. +0
1
-1, 0, 0, 0, 0, 6, 0, 1, 1, 10, 0, 10, 0, 14, 12, 4, 0, 18, 0, 16, 16, 22, 0, 20, 3, 26, 6, 22, 0, 56, 0, 11, 24, 34, 20, 29, 0, 38, 28, 30, 0, 76, 0, 34, 30, 46, 0, 42, 5, 52, 36, 40, 0, 58, 28, 40, 40, 58, 0, 92, 0, 62, 38, 26, 32, 116, 0, 52, 48, 112, 0, 54, 0, 74, 58, 58, 32, 136, 0, 60, 23, 82, 0, 124, 40, 86, 60, 60, 0, 144, 36, 70, 64 (list; graph; listen)
OFFSET

1,6

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,1000

PROGRAM

(PARI) j=[]; for(n=1, 150, a=sumdiv(n, d, if(gcd(d, n/d)==1, d)); j=concat(j, a-(eulerphi(n)+numdiv(n)))); j

(PARI) { for (n=1, 1000, a=sumdiv(n, d, if(gcd(d, n/d)==1, d)); write("b063085.txt", n, " ", a - eulerphi(n) - numdiv(n)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 17 2009]

CROSSREFS

Cf. A034448.

Sequence in context: A076413 A154305 A158781 this_sequence A020796 A011253 A049248

Adjacent sequences: A063082 A063083 A063084 this_sequence A063086 A063087 A063088

KEYWORD

easy,sign

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Aug 06 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research