login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A084391 For n>3, a(n) = smallest number divisible by exactly n-2 previous terms; a(n)=n for n<=3. 0

%I

%S 1,2,3,4,6,18,12,24,36,108,72,144,216,648,432,864,1296,3888,2592,5184,

%T 7776,23328,15552,31104,46656,139968,93312,186624,279936,839808,

%U 559872,1119744,1679616,5038848,3359232,6718464,10077696,30233088

%N For n>3, a(n) = smallest number divisible by exactly n-2 previous terms; a(n)=n for n<=3.

%C Values are 3-smooth (A003586).

%F G.f. [x * (6x^6-6x^5-4x^3-3x^2-2x-1)]/(1-6x^4) (conjectured). - _Ralf Stephan_, Feb 03 2004

%K nonn

%O 1,2

%A _Amarnath Murthy_, May 30 2003

%E More terms from _Reinhard Zumkeller_, Jun 02 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 9 20:09 EDT 2020. Contains 336326 sequences. (Running on oeis4.)