login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076953 Array T(m,n) = phi(mn)-phi(m)phi(n) (m,n >= 1), read by antidiagonals. 3
0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 4, 0, 2, 0, 0, 0, 2, 0, 0, 2, 0, 0, 0, 4, 0, 4, 4, 4, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 6, 8, 0, 8, 0, 8, 6, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 8, 0, 8, 6, 8, 0, 8, 0, 4, 0, 0, 0, 4, 0, 4, 6, 0, 0, 6, 4, 0, 4, 0, 0 (list; table; graph; refs; listen; history; internal format)
OFFSET

1,12

COMMENTS

It follows from the definition that phi(mn)-phi(m)phi(n) >= 0.

REFERENCES

D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, p. 9.

CROSSREFS

Cf. A000010, A079548, A079549, A079550.

Sequence in context: A016414 A049801 A049337 * A180472 A093315 A204267

Adjacent sequences:  A076950 A076951 A076952 * A076954 A076955 A076956

KEYWORD

nonn,tabl

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jan 24 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 23:53 EST 2012. Contains 205860 sequences.