|
Search: id:A007015
|
|
|
| A007015 |
|
a(n) = smallest k such that phi(n+k) = phi(k).
(Formerly M3212)
|
|
+0
4
|
|
| 1, 4, 3, 8, 5, 24, 5, 13, 9, 20, 7, 48, 13, 16, 13, 26, 17, 52, 19, 37, 21, 44, 13, 96, 25, 34, 27, 32, 13, 124, 17, 52, 33, 41, 19, 104, 35, 52, 37, 65, 25, 123, 17, 73, 39, 92, 41, 183, 35, 76, 39, 68, 53, 156, 35, 64, 57, 116, 41, 248, 61, 73, 61, 104, 65, 144, 67, 82
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Sierpinski proved that a solution exists for each n>0.
|
|
REFERENCES
|
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 840.
R. K. Guy, Unsolved Problems Number Theory, Sect. B36
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..10000
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, December 1972 [alternative scanned copy].
|
|
CROSSREFS
|
Cf. A000010.
Adjacent sequences: A007012 A007013 A007014 this_sequence A007016 A007017 A007018
Sequence in context: A082895 A086938 A126084 this_sequence A114562 A011451 A117956
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
njas, Mira Bernstein, Robert G. Wilson v (rgwv(AT)rgwv.com)
|
|
EXTENSIONS
|
More terms from Jud McCranie (j.mccranie(AT)comcast.net), Dec 24 1999
|
|
|
Search completed in 0.002 seconds
|
