Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A094272
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A094272 Least m >= a(n-1)+n such that m!/(m-n)! is a multiple of a(n-1)!/(a(n-1)-(n-1))!. +0
5
1, 3, 6, 10, 16, 52, 1176, 687378, 236241851626, 2197451321740962081109754668237130, 2414396155710550624720051944524837499100253655538086242554948251375 (list; graph; listen)
OFFSET

1,2

COMMENT

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 this_sequence A005045 A069241 A092263

Adjacent sequences: A094269 A094270 A094271 this_sequence 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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research