The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A143973 Distances between multiples of 3 in A000010. 1
2, 4, 1, 4, 1, 2, 5, 1, 1, 3, 4, 1, 1, 1, 1, 3, 1, 2, 4, 3, 2, 2, 1, 4, 1, 1, 2, 2, 3, 2, 1, 1, 2, 1, 1, 1, 2, 3, 2, 4, 1, 2, 2, 2, 1, 1, 4, 1, 1, 3, 1, 2, 1, 2, 3, 2, 3, 2, 2, 1, 2, 1, 3, 1, 1, 4, 1, 3, 1, 2, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 5, 1, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Inspired by the question: is n == 1 mod phi(n) for n composite?
LINKS
FORMULA
a(1) = 2 since the first two numbers k such that 3 | phi(k) are 7 and 9, and 9 - 7 = 2.
MATHEMATICA
Differences @ Position[EulerPhi[Range[200]], _?(Divisible[#, 3] &)] // Flatten (* Amiram Eldar, Feb 29 2020 *)
CROSSREFS
Sequence in context: A157284 A361523 A194733 * A011167 A014176 A317690
KEYWORD
nonn
AUTHOR
J. Perry (johnandruth(AT)jrperry.orangehome.co.uk), Sep 06 2008
EXTENSIONS
Offset corrected and more terms added by Amiram Eldar, Feb 29 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 13 02:15 EDT 2024. Contains 372497 sequences. (Running on oeis4.)