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.

A106132 Numbers k such that the k-th semiprime == 7 (mod k).

This page as a plain text file.
%I A106132 #24 Oct 16 2022 03:24:08
%S A106132 1,7,9,66,6675,6918,613374,613412,613418,613422,613428,613434,613510,
%T A106132 613512,613514,613520,613542,58155531,58155569,58155572,6384425518,
%U A106132 6384425556,819217006165,819217006175,819217006199,819217006203,819217006227,819217006665,819217006869
%N A106132 Numbers k such that the k-th semiprime == 7 (mod k).
%C A106132 a(30) > 10^12. - _Lucas A. Brown_, Oct 18 2020
%H A106132 Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/semiprimemods.py">semiprimemods.py</a>
%e A106132 a(3)=9 is a term because the 9th semiprime (i.e., 25) == 7 (mod 9).
%Y A106132 Cf. A001358, A356357.
%K A106132 hard,nonn
%O A106132 1,2
%A A106132 _Shyam Sunder Gupta_, May 07 2005
%E A106132 a(18)-a(20) from _Donovan Johnson_, Oct 29 2008
%E A106132 a(21)-a(29) by _Lucas A. Brown_, Oct 18 2020
%E A106132 a(1), a(2) by _Lucas A. Brown_, Nov 22 2020