The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A083001 Smallest oblong number having n prime divisors (with multiplicity). 1
 0, 2, 6, 12, 56, 72, 240, 1056, 4160, 4032, 50400, 65280, 1639680, 262656, 15748992, 40953600, 104867840, 16773120, 205535232, 1073774592, 4294901760, 52613120000, 32480870400, 233605472256, 68719214592, 4398044413952 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Donovan Johnson, Table of n, a(n) for n = 0..40 (terms < 2*10^21) EXAMPLE a(4)= 56 = 2*2*2*7. PROG (PARI) {ondf(m) = print1(0", "); for(n=1, m, k=1; while(bigomega(k*(k+1))!=n, k++); print1(k*(k+1)", ")) } CROSSREFS Cf. A002378. Sequence in context: A208147 A152873 A175810 * A285079 A119862 A111936 Adjacent sequences:  A082998 A082999 A083000 * A083002 A083003 A083004 KEYWORD nonn AUTHOR Jason Earls, May 30 2003 EXTENSIONS More terms from Don Reble, Jun 03 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 19 12:54 EDT 2021. Contains 345129 sequences. (Running on oeis4.)