Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128281
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128281 a[n] = is the least product of n odd primes m=p1*p2*...*pn, such that (d+m/d)/2 are all primes for each d dividing m. +0
5
3, 21, 105, 1365, 884037 (list; graph; listen)
OFFSET

1,1

EXAMPLE

105=3.5.7, (3.5.7+1)/2=53, (3+5.7)/2=19, (5+3.7)/2=13, (7+3.5)/2=11 are all primes and 105 is the least such number which is the product of 3 primes, so a[3]=3.

CROSSREFS

Cf. A128276, A128282, A128283, A128284, A128285, A128286.

Sequence in context: A074597 A076207 A134057 this_sequence A034268 A140451 A054147

Adjacent sequences: A128278 A128279 A128280 this_sequence A128282 A128283 A128284

KEYWORD

hard,more,nonn

AUTHOR

Kok Seng Chua (chuakokseng(AT)hotmail.com), Mar 05 2007

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 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research