Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069552
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069552 Numbers n such that phi(n)=sigma(core(n)) where phi(x) is the Euler totient function, sigma(x) the sum of divisors of x and core(x) the square-free part of x (the smallest integer such that x*core(x) is a square). +0
1
1, 12, 56, 140, 270, 630, 1672, 4180, 6426, 18810, 80104, 93496, 99484, 102856, 116116, 140296, 191862, 200260, 220616, 223938, 224536, 233740, 257140, 350740, 447678, 449442, 522522, 551540, 561340, 702240, 901170 (list; graph; listen)
OFFSET

1,2

PROGRAM

(PARI) for(n=1, 10^6, if(eulerphi(n)==sigma(core(n)), print1(n, ", ")))

CROSSREFS

Sequence in context: A009653 A133001 A104188 this_sequence A035005 A001386 A046998

Adjacent sequences: A069549 A069550 A069551 this_sequence A069553 A069554 A069555

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 17 2002

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 July 6 17:22 EDT 2008. Contains 140988 sequences.


AT&T Labs Research