Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A147570
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A147570 a(n) = phi(A020492(n)). +0
2
1, 1, 2, 2, 4, 6, 8, 8, 24, 12, 24, 24, 24, 48, 48, 48, 72, 48, 120, 80, 72, 192, 180, 96, 144, 180, 240, 144, 192, 240, 336, 192, 288, 720, 480, 360, 720, 720, 480, 720, 720, 720, 672, 672, 576, 720, 960, 1440, 1872, 1680, 960, 1120, 1848, 2016, 1440, 1728, 1440 (list; graph; listen)
OFFSET

1,3

EXAMPLE

a(5) = phi(A020492(5)) = phi(12) = 4.

PROGRAM

(MAGMA) [ a: n in [1..3500] | SumOfDivisors(n) mod a eq 0 where a is EulerPhi(n) ]; [From Klaus Brockhaus, Nov 09 2008]

(PARI) {for(n=1, 5000, a=eulerphi(n); if(sigma(n)%a==0, print1(a, ", ")))} [From Klaus Brockhaus, Nov 09 2008]

CROSSREFS

Cf. A000010 (Euler totient function phi(n)), A000203 (sigma(n), sum of divisors of n), A020492 (balanced numbers, numbers n such that phi(n) divides sigma(n)), A023897 (sigma(n) / phi(n) for balanced numbers), A147569.

Sequence in context: A089284 A081488 A108891 this_sequence A049625 A118303 A145817

Adjacent sequences: A147567 A147568 A147569 this_sequence A147571 A147572 A147573

KEYWORD

easy,nonn

AUTHOR

Enoch Haga (Enokh(AT)comcast.net), Nov 07 2008

EXTENSIONS

Edited by Klaus Brockhaus, Nov 09 2008

page 1

Search completed in 0.005 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