Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087623
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087623 Triangle read by rows: T(m,n) is the cardinality of the set {k in [1,n-1] : gcd(k,n)=m}. +0
2
0, 0, 1, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 1, 4, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 2, 6, 0, 0, 0, 0, 0, 1, 0, 4, 0, 0, 0, 0, 0, 0, 0, 2, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 1, 2, 4, 10, 0, 0, 0, 0, 0, 0 (list; table; graph; listen)
OFFSET

1,6

COMMENT

A generalization of Euler's phi function: T(1,n)=phi(n).

EXAMPLE

T(2,4)=1 because gcd(1,4)=1, gcd(2,4)=2, gcd(3,4)=1.

CROSSREFS

Cf. A000010.

Adjacent sequences: A087620 A087621 A087622 this_sequence A087624 A087625 A087626

Sequence in context: A130207 A083914 A083891 this_sequence A036274 A047753 A031123

KEYWORD

nonn,easy,tabl

AUTHOR

Michele Dondi (bik.mido(AT)tiscalinet.it), Sep 14, 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 October 7 08:31 EDT 2008. Contains 144667 sequences.


AT&T Labs Research