Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063469
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063469 3*Tau[n]=Phi[n]. +0
6
7, 21, 26, 56, 70, 78, 108, 126, 168, 210 (list; graph; listen)
OFFSET

1,1

COMMENT

"Phi[n]=k*Tau[n] has at most finitely many solutions for any constant k or even for slowly increasing functions like k(n)=n^(epsilon)." - Labos E. (labos(AT)ana.sote.hu), Jul 20 2001

PROGRAM

(PARI) for(n=1, 10^7, if(3*numdiv(n)==eulerphi(n), print(n)))

CROSSREFS

Cf. A062516.

Cf. A112954, A020488, A063470.

Sequence in context: A158280 A097182 A058525 this_sequence A155131 A032639 A015729

Adjacent sequences: A063466 A063467 A063468 this_sequence A063470 A063471 A063472

KEYWORD

fini,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Jul 26 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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research