Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083002
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083002 Smallest oblong number having n distinct prime divisors. +0
1
0, 2, 6, 30, 210, 4290, 43890, 510510, 53501910, 1487683470, 64790866140, 530514844860, 126408523110870, 3425113062060690, 660393717163700520 (list; graph; listen)
OFFSET

0,2

EXAMPLE

a(4)= 210 = 2*3*5*7.

PROGRAM

(PARI) {odf(m) = print1(0", "); for(n=1, m, k=1; while(omega(k*(k+1))!=n, k++); print1(k*(k+1)", ")) }

CROSSREFS

Cf. A002378.

Adjacent sequences: A082999 A083000 A083001 this_sequence A083003 A083004 A083005

Sequence in context: A046853 A071290 A093449 this_sequence A077176 A101178 A091456

KEYWORD

more,nonn

AUTHOR

Jason Earls (jcearls(AT)cableone.net), May 30 2003

EXTENSIONS

More terms from Don Reble (djr(AT)nk.ca), Jun 03 2003

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 May 11 10:28 EDT 2008. Contains 139662 sequences.


AT&T Labs Research