login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A294472 Squarefree numbers whose odd prime factors are all consecutive primes. 2
1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 22, 23, 26, 29, 30, 31, 34, 35, 37, 38, 41, 43, 46, 47, 53, 58, 59, 61, 62, 67, 70, 71, 73, 74, 77, 79, 82, 83, 86, 89, 94, 97, 101, 103, 105, 106, 107, 109, 113, 118, 122, 127, 131, 134, 137, 139, 142, 143, 146, 149, 151, 154, 157, 158, 163, 166 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

The union of products of any number of consecutive odd primes and twice products of any number of consecutive odd primes.

A073485 lists the squarefree numbers with no gaps in their prime factors >= prime(1), and {a(n)} lists the squarefree numbers with no gaps in their prime factors >= prime(2). If we let {b(n)} be the squarefree numbers with no gaps in their prime factors >= prime(3), ..., and let {x(n)} be the squarefree numbers with no gaps in their prime factors >= prime(y), ..., then A073485(n) >= a(n) >= b(n) >= ... >= x(n) >= ... >= A005117(n). [edited by Jon E. Schoenfield, May 26 2018]

Conjecture: if z(n) is the smallest y such that n*k - k^2 is a squarefree number with no gaps in their prime factors >= prime(y) for some k < n, then z(n) >= 1 for all n > 1.

The terms a(n) for which a(n-1) + 1 = a(n) = a(n+1) - 1 begin 2, 6, 14, 30, 106, ... [corrected by Jon E. Schoenfield, May 26 2018]

Squarefree numbers for which any two neighboring odd prime factors in the ordered list of prime factors are consecutive primes. - Felix Fröhlich, Nov 01 2017

LINKS

Table of n, a(n) for n=1..69.

EXAMPLE

70 is in this sequence because 2*5*7 = 70 is a squarefree number with two consecutive odd prime factors, 5 and 7.

MAPLE

N:= 1000: # to get all terms <= N

R:= 1, 2:

Oddprimes:= select(isprime, [seq(i, i=3..N, 2)]):

for i from 1 to nops(Oddprimes) do

  p:= 1:

  for k from i to nops(Oddprimes) do

    p:= p*Oddprimes[k];

    if p > N then break fi;

    if 2*p <= N then R:= R, p, 2*p

    else R:= R, p

    fi

  od;

od:

R:= sort([R]); # Robert Israel, Nov 01 2017

MATHEMATICA

Select[Range@ 166, And[Union@ #2 == {1}, Or[# == {1}, # == {}] &@ Union@ Differences@ PrimePi@ DeleteCases[#1, 2]] & @@ Transpose@ FactorInteger[#] &] (* Michael De Vlieger, Nov 01 2017 *)

CROSSREFS

Cf. A000040, A005117, A073485, A294674.

Sequence in context: A087008 A326537 A302798 * A077337 A093501 A087007

Adjacent sequences:  A294469 A294470 A294471 * A294473 A294474 A294475

KEYWORD

nonn

AUTHOR

Juri-Stepan Gerasimov, Oct 31 2017

EXTENSIONS

Definition corrected by Michel Marcus, Nov 01 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 3 01:36 EDT 2021. Contains 346429 sequences. (Running on oeis4.)