[go: up one dir, main page]
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!)
A353768 a(n) = phi(n) mod 4; Euler totient function reduced modulo 4. 5
1, 1, 2, 2, 0, 2, 2, 0, 2, 0, 2, 0, 0, 2, 0, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 2, 2, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 0, 2, 0, 2, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..65537
FORMULA
a(n) = A010873(A000010(n)).
PROG
(PARI) A353768(n) = (eulerphi(n)%4);
CROSSREFS
Cf. A000010, A010873, A066499 (positions of 2's), A172019 (of 0's).
Cf. also A074942, A261872, A084300, and also A105824.
Sequence in context: A258040 A215879 A114700 * A140666 A350628 A202145
Adjacent sequences: A353765 A353766 A353767 * A353769 A353770 A353771
KEYWORD
nonn
AUTHOR
Antti Karttunen, May 15 2022
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 August 31 00:13 EDT 2024. Contains 375550 sequences. (Running on oeis4.)