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!)
A329584 phi(A327922(n))/4, for n >= 1, with phi = A000010 (Euler's totient). 1
1, 3, 2, 4, 3, 5, 7, 5, 6, 9, 6, 10, 6, 8, 13, 10, 9, 15, 9, 12, 11, 18, 10, 15, 16, 14, 22, 18, 15, 18, 24, 15, 25, 12, 27, 18, 28, 22, 18, 24, 20, 25, 21, 27, 18, 34, 23, 30, 28, 21, 37, 24, 30, 39, 26, 33, 20, 39, 27, 43, 30, 29, 45, 30, 36, 40, 27, 48 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
This sequence applies to the odd m >= 3 numbers collected in A327922 with 4 dividing phi(2*m) = phi(m). The analog for even m is: every even numbers m >= 4 has even phi(2*m)/2 = A062570(m/2) = 2*A055034(m/2), This means that phi(2*m)/4 = A055034(m/2), for every even m >= 4.
LINKS
FORMULA
a(n) = A000010(A327922(n))/4, for n >= 1.
EXAMPLE
n = 1: A327922(1) = 5, A000010(5) = 4, hence a(1) = 1.
n = 5: A327922(5) = 21 = 3*7, A000010(21) = 2*6 = 12, hence a(5) = 3.
MATHEMATICA
Select[EulerPhi[Range[3, 200, 2]]/4, IntegerQ] (* Amiram Eldar, Nov 17 2019 *)
CROSSREFS
Sequence in context: A140114 A243852 A025532 * A335507 A195459 A133131
KEYWORD
nonn,easy
AUTHOR
Wolfdieter Lang, Nov 17 2019
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 March 28 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)