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!)
A077542 Least number of terms required in the product (k+1)(k+2)... to make it a multiple of the product of next n number, where k = n(n+1)/2. 2
1, 3, 4, 6, 6, 7, 11, 10, 10, 13, 14, 17, 14, 20, 25, 19, 21, 19, 32, 24, 28, 34, 25, 33, 27, 36, 46, 35, 42, 31, 53, 36, 49, 54, 41, 44, 39, 63, 46, 56, 62, 51, 59, 54, 71, 81, 57, 70, 56, 83, 88, 77, 84, 67, 95, 69, 98, 97, 84, 96, 71, 84, 75, 100, 102, 78, 95, 79, 125 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
For n > 5, a(n) >= 2p - n, where p is the largest prime less than n(n+1)/2.
LINKS
FORMULA
Let A077540(n) = (k+1)(k+2)...(k+r) where k = n(n+1)/2 then a(n) = r.
EXAMPLE
a(3) = 4 as A077540(3) = 5040 = 7*8*9*10 = (6+1)(6+2)(6+3)(6+4).
PROG
(PARI) for(n=1, 100, p=1:t=n*(n+1)/2:f=1:for(k=1, n, f=f*(n+k)):for(k=1, 10^9, p=p*(t+k): if(p%f==0, print1(k", "):break)))
CROSSREFS
Sequence in context: A135319 A329193 A004219 * A325611 A263842 A286956
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Nov 09 2002
EXTENSIONS
Corrected and extended by Ralf Stephan, Mar 27 2003
STATUS
approved

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 July 14 04:38 EDT 2024. Contains 374291 sequences. (Running on oeis4.)