cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A355297 a(n) = A007088(n) mod n.

Original entry on oeis.org

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
Offset: 1

Views

Author

Ctibor O. Zizka, Jun 27 2022

Keywords

Comments

a(n) = 0 see A032533, a(n) = 1 see A339567.

Examples

			n = 7; a(7) = A007088(7) mod 7 = 111 mod 7 = 6.
		

Crossrefs

Programs

  • Mathematica
    a[n_] := Mod[FromDigits[IntegerDigits[n, 2]], n]; Array[a, 100] (* Amiram Eldar, Jun 27 2022 *)

Formula

a(n) = A007088(n) mod n. a(n) = A007088(n) - n * floor(A007088(n)/n).