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.

A073437 Smallest x such that remainder Mod[A065855(x), A000720(x)]=n.

Original entry on oeis.org

4, 6, 8, 21, 22, 25, 26, 27, 30, 33, 66, 70, 77, 78, 82, 86, 87, 88, 92, 93, 94, 95, 96, 100, 116, 117, 118, 119, 120, 219, 220, 221, 222, 247, 248, 249, 250, 255, 256, 261, 262, 267, 268, 289, 290, 291, 292, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 323
Offset: 1

Views

Author

Labos Elemer, Jul 31 2002

Keywords

Examples

			Remainder 4 appears first as Mod[G[21],Pi[21]]= Mod[21-Pi[21]-1,Pi[21]]=Mod[21-8-1,8]=Mod[12,8]=4, so a(4)=21.
		

Crossrefs