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!)
A355297 a(n) = A007088(n) mod n. 0
0, 0, 2, 0, 1, 2, 6, 0, 2, 0, 10, 8, 9, 4, 1, 0, 5, 2, 17, 0, 0, 12, 14, 8, 1, 12, 22, 12, 23, 10, 13, 0, 11, 16, 16, 20, 16, 18, 37, 0, 18, 0, 4, 32, 31, 2, 14, 32, 45, 10, 4, 16, 20, 4, 1, 8, 22, 56, 32, 40, 20, 6, 42, 0, 41, 44, 36, 24, 15, 20, 5, 56, 25, 12, 61, 28, 24, 58, 23, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
a(n) = 0 see A032533, a(n) = 1 see A339567.
LINKS
FORMULA
a(n) = A007088(n) mod n. a(n) = A007088(n) - n * floor(A007088(n)/n).
EXAMPLE
n = 7; a(7) = A007088(7) mod 7 = 111 mod 7 = 6.
MATHEMATICA
a[n_] := Mod[FromDigits[IntegerDigits[n, 2]], n]; Array[a, 100] (* Amiram Eldar, Jun 27 2022 *)
CROSSREFS
Sequence in context: A127755 A180662 A318144 * A260663 A241857 A342020
KEYWORD
nonn,base
AUTHOR
Ctibor O. Zizka, Jun 27 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 July 16 00:06 EDT 2024. Contains 374343 sequences. (Running on oeis4.)