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.

A375111 a(n) = A375110(n) mod A375110(n+1).

This page as a plain text file.
%I A375111 #10 Aug 04 2024 12:43:00
%S A375111 0,1,0,2,0,3,1,3,1,0,4,0,5,2,4,1,5,2,5,2,0,6,1,6,1,0,7,0,8,3,6,2,7,1,
%T A375111 8,3,7,2,8,4,7,3,8,4,8,4,0,9,1,9,2,9,3,9,3,0,10,1,10,2,10,2,0,11,1,11,
%U A375111 1,0,12,0,13,5,9,4,10,3,11,2,12,1,13,5,10
%N A375111 a(n) = A375110(n) mod A375110(n+1).
%H A375111 Rémy Sigrist, <a href="/A375111/b375111.txt">Table of n, a(n) for n = 1..10000</a>
%H A375111 Rémy Sigrist, <a href="/A375111/a375111.gp.txt">PARI program</a>
%e A375111 a(42) = A375110(42) mod A375110(43) = 11 mod 8 = 3.
%o A375111 (PARI) \\ See Links section.
%Y A375111 Cf. A375110.
%K A375111 nonn
%O A375111 1,4
%A A375111 _Rémy Sigrist_, Jul 30 2024