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.

A099644 a[n]=Mod[q(n),PrimePi[q(n)]]=Mod[A001359(n), A000720(A001359(n))] where q(n) is the n-th lesser-twin-prime. A004648 restricted to lesser twins.

This page as a plain text file.
%I A099644 #5 Jan 09 2024 12:14:19
%S A099644 1,2,1,3,9,2,8,11,23,23,5,9,15,19,17,31,31,41,41,55,2,14,16,16,31,49,
%T A099644 54,52,61,59,109,111,107,117,121,164,166,169,171,181,11,23,41,35,29,
%U A099644 29,77,71,77,71,89,83,95,107,113,125,155,149,167,173,185,185,203,197,203,209
%N A099644 a[n]=Mod[q(n),PrimePi[q(n)]]=Mod[A001359(n), A000720(A001359(n))] where q(n) is the n-th lesser-twin-prime. A004648 restricted to lesser twins.
%C A099644 Sequence display diagram similar to that of A004648.
%e A099644 n=9: p(26)=101 is the 9th lesser-twin-prime,
%e A099644 a(9)-Mod[p(26),26]=Mod[101,26]=23=a(9).
%Y A099644 Cf. A001359, A004648.
%K A099644 nonn
%O A099644 1,2
%A A099644 _Labos Elemer_, Nov 04 2004