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.

A076238 a(n) = A050436(n) mod A002808(n).

Original entry on oeis.org

0, 3, 1, 8, 8, 9, 8, 8, 7, 6, 8, 7, 6, 4, 5, 4, 3, 4, 4, 4, 3, 2, 2, 2, 1, 0, 0, 0, 43, 43, 44, 45, 45, 45, 47, 48, 50, 50, 50, 53, 53, 55, 55, 55, 55, 56, 56, 56, 56, 56, 58, 59, 60, 62, 63, 63, 65, 65, 65, 68, 68, 68, 68, 68, 69, 69, 69, 69, 70, 70, 72, 72, 73, 74, 74, 76, 78, 78
Offset: 1

Views

Author

Labos Elemer, Oct 08 2002

Keywords

Crossrefs

Formula

a(n)=Mod[ccc[n], c[n]]=Mod[A050436(n), A002808[n]]