Statements (30)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
integer sequence
|
| gptkbp:author |
gptkb:N._J._A._Sloane
|
| gptkbp:citation |
gptkb:A001221
gptkb:A007434 gptkb:A008683 A000010 |
| gptkbp:database |
gptkb:OEIS
|
| gptkbp:describes |
Euler's totient function φ(n): number of positive integers ≤ n that are coprime to n.
|
| gptkbp:first_terms |
2
1 10 12 14 16 18 20 24 4 6 8 |
| gptkbp:form |
φ(n) = n * Π_{p|n} (1 - 1/p), where the product is over the distinct prime numbers dividing n.
|
| gptkbp:hasKeyword |
easy
nonn |
| https://www.w3.org/2000/01/rdf-schema#label |
A002322
|
| gptkbp:OEIS |
gptkb:A002322
|
| gptkbp:sequence |
gptkb:Euler_totient_function_φ(n)
arithmetic function multiplicative function |
| gptkbp:bfsParent |
gptkb:A000010_(OEIS)
|
| gptkbp:bfsLayer |
7
|