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
%I A083001
%S A083001 0,2,6,12,56,72,240,1056,4160,4032,50400,65280,1639680,262656,15748992,
%T A083001 40953600,104867840,16773120,205535232,1073774592,4294901760,
%U A083001 52613120000,32480870400,233605472256,68719214592,4398044413952
%N A083001 Smallest oblong number having n prime divisors (with multiplicity).
%e A083001 a(4)= 56 = 2*2*2*7.
%o A083001 (PARI) {ondf(m) = print1(0","); for(n=1,m,k=1; while(bigomega(k*(k+1))!=n,
               k++); print1(k*(k+1)",")) }
%Y A083001 Cf. A002378.
%Y A083001 Sequence in context: A056744 A164859 A152873 this_sequence A119862 A111936 
               A002805
%Y A083001 Adjacent sequences: A082998 A082999 A083000 this_sequence A083002 A083003 
               A083004
%K A083001 nonn
%O A083001 0,2
%A A083001 Jason Earls (zevi_35711(AT)yahoo.com), May 30 2003
%E A083001 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 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research