Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A065149
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A065149 Phi[m]*Sigma[m] is divisible by m-1. +0
1
10, 33, 65, 136, 145, 261, 385, 451, 897, 946, 1281, 1441, 1665, 1729, 2241, 2353, 3585, 5185, 6721, 7201, 8380, 8911, 8961, 11521, 11782, 12673, 12801, 17101, 18241, 20737, 25201, 26625, 26677, 26937, 29697, 29953, 30721, 30889, 32896 (list; graph; listen)
OFFSET

0,1

FORMULA

Mod[A000010[m]*A000203[m], m-1]=0, m is composite.

EXAMPLE

m=136, Phi[136]=64, Sigma[136]=270, product=17280, quotient=128; for primes the formula holds.

MATHEMATICA

Do[s=EulerPhi[n]*DivisorSigma[1, n]; If[IntegerQ[s/(n-1)]&&!PrimeQ[n], Print[n]], {n, 1, 100000}]

CROSSREFS

A000010, A000203, A062354, A011257.

Adjacent sequences: A065146 A065147 A065148 this_sequence A065150 A065151 A065152

Sequence in context: A067878 A067877 A063160 this_sequence A085490 A081437 A003012

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Oct 18 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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research