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.

A088077 a(n) is the least number m sandwiched between m-1 and m+1, both with special properties as follows: both are squarefree; both have n distinct prime factors.

This page as a plain text file.
%I A088077 #16 Jun 21 2022 05:03:50
%S A088077 4,34,664,18446,887314,84946016,3086525014,557027507464,
%T A088077 31110090768184,3404401335645584,609352762511672906
%N A088077 a(n) is the least number m sandwiched between m-1 and m+1, both with special properties as follows: both are squarefree; both have n distinct prime factors.
%C A088077 a(n) is surely larger than the n-th, but seems even larger than the (n+1)-th primorial number.
%C A088077 a(n) is neither necessarily squarefree nor it has a specified number of distinct prime-factors.
%e A088077 a(3) = 664, 663 = 3*13*17 and 665 = 5*11*19 both have three prime divisors.
%t A088077 lf[x_] := Length[FactorInteger[x]] am[x_] := Abs[MoebiusMu[x]] q[x_] := Apply[Times, Table[Prime[j], {j, 1, x}]] Table[flag=1; Print["#"]; Do[s1=am[n-1]; s2=am[n+1]; If[Equal[s1, 1]&&Equal[s2, 1]&&Equal[lf[n-1], j] &&Equal[lf[n+1], j]&&Equal[flag, 1], Print[{n, j}]; flag=0], {n, q[j], q[j]+...}], {j, 1, 4}]
%Y A088077 Cf. A002110, A001221.
%K A088077 nonn,hard,more
%O A088077 1,1
%A A088077 _Amarnath Murthy_, Sep 22 2003
%E A088077 Edited by _Labos Elemer_, Sep 26 2003
%E A088077 84946016 from _Ray Chandler_, Oct 09 2003
%E A088077 a(7) and a(8) from _Donovan Johnson_, Apr 22 2008
%E A088077 a(9)-a(11) from _Donovan Johnson_, Feb 18 2009