login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A091861 a(1) = 1; a(n) = smallest positive unpicked integer such that n-k divides evenly into a(n)*a(k) for every k, 1 <= k <= n-1. 0

%I #9 Apr 09 2014 10:13:40

%S 1,2,4,3,12,30,60,420,840,1260,630,27720,4620,60060,30030,120120,

%T 240240,2042040,3063060,232792560,58198140,38798760,19399380,

%U 446185740,892371480,2230928700,4461857400,40156716600,20078358300,582272390700

%N a(1) = 1; a(n) = smallest positive unpicked integer such that n-k divides evenly into a(n)*a(k) for every k, 1 <= k <= n-1.

%K nonn

%O 1,2

%A _Leroy Quet_, Mar 13 2004

%E More terms from _John W. Layman_, May 18 2004

%E Further terms from _Jon E. Schoenfield_, Jun 21 2007

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 05:26 EDT 2024. Contains 371918 sequences. (Running on oeis4.)