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.

A350096 a(n) is the larger of 2 consecutive primes bounding an interval containing a record number A350097(n) of odd squarefree semiprimes (A046388).

This page as a plain text file.
%I A350096 #16 Mar 21 2024 08:36:27
%S A350096 17,37,97,211,223,907,1151,1361,10007,15727,19661,44351,156007,370373,
%T A350096 396833,492227,1357333,1671907,3826157,17836561,20831533,47465443,
%U A350096 107534789,122164969,434865671,436273291,2300942869,4302407713,10726905041,25056082543,42652618807
%N A350096 a(n) is the larger of 2 consecutive primes bounding an interval containing a record number A350097(n) of odd squarefree semiprimes (A046388).
%H A350096 Lucas A. Brown, <a href="/A350096/b350096.txt">Table of n, a(n) for n = 1..32</a> (terms 1-28 from _Hugo Pfoertner_, 29-31 from _Martin Ehrenstein_)
%H A350096 Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/A350097.py">Python program</a>.
%F A350096 a(n) = nextprime(A350095(n)).
%e A350096 See A350095.
%Y A350096 A350097 gives the corresponding counts.
%Y A350096 Cf. A000101, A002386, A005250, A046388, A349995, A350095.
%K A350096 nonn
%O A350096 1,1
%A A350096 _Hugo Pfoertner_, Dec 25 2021
%E A350096 a(29)-a(31) from _Martin Ehrenstein_, Dec 28 2021
%E A350096 a(32) from _Lucas A. Brown_, Mar 21 2024