login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088075 Smallest number sandwiched between two numbers having exactly n prime divisors. 2
3, 11, 131, 1429, 77141, 1456729, 117048931, 10326137821, 1110819807371, 140734085123059, 11639258217451019 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(n)=m is the smallest number sandwiched between m-1 and m+1 such that both m+1 and m-1 have n distinct prime-factors. No restrictions are imposed for {m-1,m+1} flanker numbers.
REFERENCES
Jean-Marie De Koninck, "Those Fascinating Numbers", American Mathematical Society, 2009, entry 1428. (This gives the lower of the two numbers.)
LINKS
FORMULA
a(n) = Min{A001221(x-1) = A001221(x+1) = n} x.
EXAMPLE
n = 3: a(3) = 131, 130 = 2*5*13 and 132 = 2^2*3*11 both have three prime divisors.
n = 6: a(6) = 1456729 = 103*14143 is between 1456728 = 8*3*7*13*23*29 and 1456730 = 2*5*11*17*19*41.
PROG
(PARI) isok(k, n) = (omega(k-1)==n) && (omega(k+1)==n);
a(n) = my(k=2); while (!isok(k, n), k++); k; \\ Michel Marcus, Sep 03 2023
CROSSREFS
Sequence in context: A274664 A219620 A201611 * A088076 A276258 A284604
KEYWORD
nonn,more
AUTHOR
Amarnath Murthy, Sep 22 2003
EXTENSIONS
Edited by Labos Elemer, Sep 30 2003
More terms from Ray Chandler, Oct 07 2003
a(8)-a(9) from Donovan Johnson, Jun 19 2008
a(10)-a(11) from Donovan Johnson, Feb 18 2009
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 18 22:56 EDT 2024. Contains 370952 sequences. (Running on oeis4.)