cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A119250 Smallest number greater than n having a maximal number of divisors d such that d-1 are divisors of n.

This page as a plain text file.
%I A119250 #6 Mar 17 2018 21:22:17
%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,
%T A119250 78,42,140,30,30,84,32,90,204,630,72,60,38,60,280,90,42,84,44,60,60,
%U A119250 1128,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.
%K A119250 nonn
%O A119250 1,1
%A A119250 _Reinhard Zumkeller_, May 10 2006