Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A152048
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A152048 Smallest divisor of A002182(n) >= sqrt(A002182(n)) +0
2
1, 2, 2, 3, 4, 6, 6, 8, 10, 12, 15, 16, 20, 30, 30, 36, 42, 56, 72, 90, 105, 126, 144, 168, 168, 216, 225, 240, 297, 336, 420, 480, 528, 594, 720, 770, 840, 858, 1080, 1232, 1485, 1716, 1925, 2080, 2574, 2730, 2970, 3300, 3850, 4160, 4680, 5720, 6120, 6600, 7854 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) = A002182(n) / A152047(n). [From Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Nov 27 2008]

EXAMPLE

a(9) = 10 because the ninth highly composite number is 60 and 10 is the smallest divisor of 60 >= sqrt(60). (Although 8 >= sqrt(60), 8 does not qualify because it is not a divisor of 60.)

CROSSREFS

A152047

Sequence in context: A152047 A101344 A161204 this_sequence A046934 A093594 A008806

Adjacent sequences: A152045 A152046 A152047 this_sequence A152049 A152050 A152051

KEYWORD

nonn

AUTHOR

J. Lowell (jhbubby(AT)mindspring.com), Nov 21 2008

EXTENSIONS

Extended beyond a(9) by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Nov 27 2008

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 6 22:55 EST 2009. Contains 170429 sequences.


AT&T Labs Research