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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A083130 Consider triangle in which n-th row contains the smallest set of n consecutive numbers whose LCM is divisible by primorial(n) (the product of first n primes). Sequence contains the first column. 2
2, 2, 3, 4, 7, 9, 11, 32, 113, 110, 85, 433, 368, 770, 1878, 888, 2537, 14088, 17748, 17747, 20293, 20292, 59407, 168902, 70209, 2542357, 3703353, 3703352, 3703356, 4430950, 122391287, 124835381, 174729495, 393352750, 1235974650, 2448949093 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

EXAMPLE

2

2 3

3 4 5

4 5 6 7

7 8 9 10 11

9 10 11 12 13 14

11 12 13 14 15 16 17

...

PROG

(PARI) doIt(partial, current, n) = local(p, nextP); p = prime(current); if (p <= n, leastFound = lift(partial), for (i = 1, n, nextP = chinese(Mod(-i, p), partial); if (lift(nextP) < leastFound, doIt(nextP, current - 1, n)))); print(2); for (j = 2, 50, leastFound = prime(j)^j; for (k = 1, j, doIt(Mod(-k, prime(j)), j - 1, j)); print(leastFound + 1));

CROSSREFS

Cf. A083129.

Sequence in context: A091605 A145468 A125554 * A083129 A110160 A003179

Adjacent sequences:  A083127 A083128 A083129 * A083131 A083132 A083133

KEYWORD

nonn

AUTHOR

Amarnath Murthy and Meenakshi Srikanth (amarnath_murthy(AT)yahoo.com), Apr 23 2003

EXTENSIONS

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Oct 25 2004

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 13 19:54 EST 2012. Contains 205536 sequences.