|
Search: id:A079008
|
|
|
| A079008 |
|
a(n) = smallest number such that the n successive values of Phi[n+j] (j=0,..n-1) are all distinct. |
|
+0
2
|
|
| 1, 2, 5, 11, 11, 17, 17, 37, 46, 46, 112, 112, 123, 149, 149, 149, 257, 257, 257, 257, 257, 257, 257, 261, 658, 658, 685, 741, 741, 1359, 1359, 1359, 1359, 1359, 1359, 1359, 1359, 1359, 1359, 1359, 1359, 1359, 1359, 1359, 1359, 4097, 4097, 4097, 4097, 4097
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
n=8: a(8)=37,values of phi[k] for k=37,..44 are: {36,18,24,16,40,12,42,20}.
|
|
MATHEMATICA
|
kul[x_] := Length[x]-Length[Union[x]] frt[x_] := Table[EulerPhi[x+j], {j, 0, h-1}] Table[fa=1; k=0; Do[s=fd1[n]; s1=kul[s]; If[Equal[s1, 0]&&Equal[fa, 1], k=k+1; Print[{k, n, h, EulerPhi[n], s}]; fa=0], {n, 1, 10000}], {h, 1, 50}]
|
|
CROSSREFS
|
Cf. A079007, A048892.
Adjacent sequences: A079005 A079006 A079007 this_sequence A079009 A079010 A079011
Sequence in context: A018862 A127011 A069162 this_sequence A062251 A091114 A079782
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Jan 08 2003
|
|
|
Search completed in 0.002 seconds
|
