Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083001
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083001 Smallest oblong number having n prime divisors (with multiplicity). +0
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; listen)
OFFSET

0,2

EXAMPLE

a(4)= 56 = 2*2*2*7.

PROGRAM

(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: A056744 A164859 A152873 this_sequence A119862 A111936 A002805

Adjacent sequences: A082998 A082999 A083000 this_sequence A083002 A083003 A083004

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

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


AT&T Labs Research