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.

A343670 a(n) is the least semiprime congruent to 1 (mod n-th semiprime).

This page as a plain text file.
%I A343670 #33 May 24 2021 13:43:40
%S A343670 9,25,10,21,15,46,22,111,26,183,34,35,106,39,118,93,295,205,111,58,
%T A343670 291,187,326,346,371,155,247,86,87,262,183,94,95,381,213,334,346,119,
%U A343670 358,122,123,247,259,134,403,142,143,287,146,731,466,159,319,323,831,339,178,535,1099,371,562
%N A343670 a(n) is the least semiprime congruent to 1 (mod n-th semiprime).
%e A343670 9 = 4*2+1, 25 = 6*4+1, 10 = 9*1+1.
%t A343670 sp = Select[Range[4, 10^3], 2 == PrimeOmega[#] &]; Table[n = sp[[k]]; a = n; While[2 != PrimeOmega[a + 1], a = a + n]; a + 1, {k, 100}]
%Y A343670 Cf. A001358, A108181, A112771.
%K A343670 nonn
%O A343670 1,1
%A A343670 _Zak Seidov_, May 09 2021