login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094272 Least m >= a(n-1)+n such that m!/(m-n)! is a multiple of a(n-1)!/(a(n-1)-(n-1))!. 5
1, 3, 6, 10, 16, 52, 1176, 687378, 236241851626, 2197451321740962081109754668237130, 2414396155710550624720051944524837499100253655538086242554948251375 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

a(1)=1. Main diagonal of triangle A094270.

If p is a prime factor of any of a(n-1)-(n-1) to a(n-1), then a(n) mod p < n.

LINKS

Martin Fuller, Table of n, a(n) for n = 1..12

Martin Fuller, PARI/GP program for A094272

EXAMPLE

Product of the terms of the 4-th row = 7*8*9*10 = 5040. Product of the terms of the 5-th row = 12*13*14*15*16 = 524160 = 104*5040.

CROSSREFS

Cf. A094270, A094271, A094273, A094274.

Sequence in context: A033541 A038505 A119971 * A005045 A189376 A069241

Adjacent sequences:  A094269 A094270 A094271 * A094273 A094274 A094275

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 27 2004

EXTENSIONS

Edited by Martin Fuller (martin_n_fuller(AT)btinternet.com), Jun 13 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 22:30 EST 2012. Contains 205678 sequences.