Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076953
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076953 Array T(m,n) = phi(mn)-phi(m)phi(n) (m,n >= 1), read by antidiagonals. +0
4
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; listen)
OFFSET

1,12

COMMENT

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 this_sequence A093315 A132784 A133873

Adjacent sequences: A076950 A076951 A076952 this_sequence A076954 A076955 A076956

KEYWORD

nonn,tabl

AUTHOR

njas, Jan 24 2003

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 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research