Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135060
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135060 a(n) = smallest number m for which none of the first n multiples of m has twice as many divisors as m. +0
5
1, 2, 6, 12, 60, 120, 840, 840 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) is smallest value m where A129902(m)/m >= n.

Conjecture: every number in this sequence is also in A002182. Comment from J. Lowell (jhbubby(AT)mindspring.com), Jun 06 2008: The conjecture that every term is a multiple of the preceding term is disproved at n = 15; a(15) = 1081080, which is not a multiple of 720720.

EXAMPLE

60 does not qualify for a(6) because 60 has 12 divisors and 60*6=360 has 12*2=24 divisors

CROSSREFS

Adjacent sequences: A135057 A135058 A135059 this_sequence A135061 A135062 A135063

Sequence in context: A126915 A002201 A004490 this_sequence A072486 A096123 A081125

KEYWORD

more,nonn

AUTHOR

J. Lowell (jhbubby(AT)mindspring.com), Feb 11 2008, Jul 08 2008, Jul 14 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 October 11 13:47 EDT 2008. Contains 144830 sequences.


AT&T Labs Research