|
Search: id:A134269
|
|
|
| A134269 |
|
The Euler phi function (number of integers less than n which are coprime with n) involves calculating the expression p^k-p^(k-1), where p is prime. For example phi(120)=phi(2^3*3*5)=(2^3-2^2)(3-1)(5-1)=4*2*4=32. This sequence gives the number of solutions to the equation p^k-p^(k-1)=n, for each n, where k is a positive integer, and p is prime. Notice that it is not possible to have more than 2 solutions, but say when n=4 there are two solutions, namely 5-1 and 2^3-2^2. |
|
+0
1
|
|
| 1, 1, 0, 2, 0, 2, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 2, 0, 2
(list; graph; listen)
|
|
|
|
|
Search completed in 0.002 seconds
|
