login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A083002 Smallest oblong number having n distinct prime divisors. 1
0, 2, 6, 30, 210, 4290, 43890, 510510, 53501910, 1487683470, 64790866140, 530514844860, 126408523110870, 3425113062060690, 660393717163700520, 26657280574571657010, 3448055881024876471350, 308480161111936386482910 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

a(18) <= 32521466098360753728404190. - Donovan Johnson, Oct 05 2011

EXAMPLE

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

PROG

(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, A059958.

Sequence in context: A071290 A185693 A093449 * A192929 A077176 A101178

Adjacent sequences:  A082999 A083000 A083001 * A083003 A083004 A083005

KEYWORD

nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), May 30 2003

EXTENSIONS

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

a(15)-a(16) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Apr 26 2009

a(17) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Sep 15 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 13:28 EST 2012. Contains 206031 sequences.