Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A154598
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A154598 a(n) = smallest prime p such that p-1 and p+1 both have n prime factors. +0
4
5, 19, 89, 271, 1889, 10529, 75329, 157951, 3885569, 11350529, 98690561, 65071999, 652963841, 6548416001, 253401579521, 160283668481, 1851643543553, 3450998226943, 23114453401601, 1194899749142527, 1101483715526657, 7093521158963201 (list; graph; listen)
OFFSET

2,1

COMMENT

Factors are counted with multiplicity. Sequence begins at a(2) since no prime p exists such that the adjacent numbers p-1 and p+1 have just one factor. For p = 2, p-1 has zero factors; for p >= 3, p+1 has at least two factors.

a(24) > 2^54. [From Jon E. Schoenfield (jonscho(AT)hiwaay.net), Feb 08 2009]

EXAMPLE

For p = 19, p-1 = 18 = 2*3*3 and p+1 = 20 = 2*2*5 both have three factors and 19 is the smallest such prime. For p = 271, p-1 = 270 = 2*3*3*3*5 and p+1 = 272 = 2*2*2*2*17 both have five factors and 271 is the smallest prime surrounded by numbers with five factors.

For p = 89, p-1 = 88 = 2*2*2*11 and p+1 = 90 = 2*3*3*5 both have four factors and 89 is the smallest such prime. For p = 1889, p-1 = 1888 = 2*2*2*2*2*59 and p+1 = 1890 = 2*3*3*3*5*7 both have six factors and 1889 is the smallest prime surrounded by numbers with six factors.

PROGRAM

(PARI) {for(n=2, 14, p=2; while(!(bigomega(p-1)==n&&bigomega(p+1)==n), p=nextprime(p+1)); print1(p, ", "))}

CROSSREFS

Cf. A001222 (number of prime divisors of n).

Sequence in context: A149799 A149800 A147099 this_sequence A149801 A149802 A149803

Adjacent sequences: A154595 A154596 A154597 this_sequence A154599 A154600 A154601

KEYWORD

nonn,nice,hard

AUTHOR

J. M. Bergot (thekingfishb(AT)yahoo.ca), Jan 12 2009

EXTENSIONS

Edited, 2 removed, 151 replaced by 89 and a(6) - a(14) added by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jan 12 2009

a(15) from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jan 14 2009

a(16)-a(20) from Jon E. Schoenfield (jonscho(AT)hiwaay.net) and Donovan Johnson (donovan.johnson(AT)yahoo.com), Jan 21 2009

a(21) from Jon E. Schoenfield (jonscho(AT)hiwaay.net), Jan 27 2009

a(22) from Jon E. Schoenfield (jonscho(AT)hiwaay.net), Jan 28 2009

a(23) from Jon E. Schoenfield (jonscho(AT)hiwaay.net), Jan 30 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 9 18:50 EST 2009. Contains 170568 sequences.


AT&T Labs Research