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.

A106133 Numbers k such that the k-th semiprime == 8 (mod k).

This page as a plain text file.
%I A106133 #17 Oct 13 2022 12:48:27
%S A106133 1,2,62,65,82,613417,613423,613425,613427,613435,613446,613515,613517,
%T A106133 613606,6384425573,6384425633,6384425637,6384425639,6384425645,
%U A106133 6384425651
%N A106133 Numbers k such that the k-th semiprime == 8 (mod k).
%C A106133 a(21) > 10^12. - _Lucas A. Brown_, Oct 18 2020
%H A106133 Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/semiprimemods.py">semiprimemods.py</a>
%e A106133 a(3)=62 is a term because the 62nd semiprime (i.e., 194) == 8 (mod 62).
%Y A106133 Cf. A001358.
%K A106133 nonn,hard,more
%O A106133 1,2
%A A106133 _Shyam Sunder Gupta_, May 07 2005
%E A106133 a(15)-a(20) by _Lucas A. Brown_, Oct 18 2020
%E A106133 a(1), a(2) by _Lucas A. Brown_, Nov 22 2020