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.

Showing 1-1 of 1 results.

A076239 Remainder when 3rd-order composite ccc(n) = A050436(n) is divided by n.

Original entry on oeis.org

0, 1, 1, 2, 3, 3, 1, 6, 3, 2, 4, 1, 11, 10, 10, 8, 6, 6, 7, 8, 6, 4, 3, 2, 2, 0, 26, 0, 0, 28, 28, 29, 28, 27, 28, 28, 30, 29, 28, 30, 29, 31, 31, 30, 29, 29, 28, 28, 27, 26, 28, 29, 29, 30, 30, 29, 31, 30, 29, 32, 31, 30, 29, 28, 29, 28, 27, 26, 26, 25, 26, 26, 26, 26, 26, 28, 29
Offset: 1

Views

Author

Labos Elemer, Oct 08 2002

Keywords

Crossrefs

Programs

  • Mathematica
    MapIndexed[Mod[#1, First@ #2] &, #] &@ Nest[Values@ KeySelect[ MapIndexed[ First@ #2 -> #1 &, #], CompositeQ] &, Select[Range@ 183, CompositeQ], 2] (* Michael De Vlieger, Jul 22 2017 *)

Formula

a(n) = ccc(n) mod n = A050436(n) mod n.
Showing 1-1 of 1 results.