Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A119250
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A119250
%S A119250 2,6,4,6,6,12,8,30,20,66,12,60,14,24,48,30,18,84,20,30,88,276,24,60,78,
%T A119250 42,140,30,30,84,32,90,204,630,72,60,38,60,280,90,42,84,44,60,60,1128,
%U A119250 48,60,200,66,468,210,54,84,168,120,580,1770,60,420,62,96,440,90,462,84
%N A119250 Smallest number greater than n having a maximal number of divisors d 
               such that d-1 are divisors of n.
%C A119250 Let x(0)=1 and x(k)=LCM(x(k-1),d(k)) with = 1<=k<=A000005(n), where d(k)=(k-th 
               divisor of n): A057643(n)=x(A000005(n)) and a(n)=Min{x(i):x(i)>n}.
%C A119250 a(n) = n+1 iff n is an odd prime;
%C A119250 A057643(n) = x(A000005(n)) and a(n) = Min{x(i): x(i)>n}.
%Y A119250 Cf. A027750.
%Y A119250 Sequence in context: A010465 A065630 A110633 this_sequence A059773 A127399 
               A151689
%Y A119250 Adjacent sequences: A119247 A119248 A119249 this_sequence A119251 A119252 
               A119253
%K A119250 nonn
%O A119250 1,1
%A A119250 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 10 2006

    
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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research