Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088075
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088075 Smallest number sandwiched between two numbers having exactly n prime divisors. +0
2
3, 11, 131, 1429, 77141, 1456729, 117048931, 10326137821, 1110819807371, 140734085123059, 11639258217451019 (list; graph; listen)
OFFSET

1,1

COMMENT

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.

FORMULA

a(n)=Min{x; A001221[x-1]=A001221[x+1]=n}

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.

CROSSREFS

Cf. A088076, A088077, A001221.

Sequence in context: A102847 A113258 A113848 this_sequence A088076 A072878 A112957

Adjacent sequences: A088072 A088073 A088074 this_sequence A088076 A088077 A088078

KEYWORD

more,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 22 2003

EXTENSIONS

Edited by Labos E. (labos(AT)ana.sote.hu), Sep 30 2003

More terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 07 2003

a(8) and a(9) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Jun 19 2008

a(10)-a(11) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Feb 18 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research