Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A015613
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A015613 a(n)=sum(i=1,n,eulerphi(i)*ceil(n/i))-sum(i=1,n,eulerphi(i)*floor(n/i)). +0
1
0, 0, 1, 2, 5, 6, 11, 14, 19, 22, 31, 34, 45, 50, 57, 64, 79, 84, 101, 108, 119, 128, 149, 156, 175, 186, 203, 214, 241, 248, 277, 292, 311, 326, 349, 360, 395, 412, 435, 450, 489, 500, 541, 560, 583, 604, 649, 664, 705, 724, 755, 778, 829, 846, 885, 908, 943 (list; graph; listen)
OFFSET

1,4

FORMULA

a(n) = sum of phi(e) where e ranges over all non-divisors of n that are between 1 and n. - Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Oct 24 2002

a(n) = A002088(n) - n.

MATHEMATICA

f[n_] := Module[{s, i}, s = 0; For[i = 1, i < n, i++, If[Mod[n, i] != 0, s = s + EulerPhi[i]]]; s]; Table[f[i], {i, 1, 100}]

CROSSREFS

Sequence in context: A092306 A090552 A024520 this_sequence A135013 A103035 A088273

Adjacent sequences: A015610 A015611 A015612 this_sequence A015614 A015615 A015616

KEYWORD

nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Oct 24 2002

EXTENSIONS

Edited by Vladeta Jovovic (vladeta(AT)Eunet.yu), Mar 23 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research