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!)
A079782 Final term of n-th row of triangle in A079784. 4
2, 5, 11, 11, 59, 59, 419, 839, 2519, 2519, 27719, 27719, 360359, 360359, 360359, 720719, 12252239, 12252239, 232792559, 232792559, 232792559, 232792559, 5354228879, 5354228879, 26771144399, 26771144399, 80313433199, 80313433199, 2329089562799, 2329089562799 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
For n >= 4, a(n) = A003418(n) - 1. Also for n < 4, a(n) is the smallest number congruent to (i-1) (mod i) for any i in {1..n}. That results directly from the definition of A003418 (if p == 0 (mod q), p-1 == (q-1) (mod q)) and from the first comment. - Philippe LALLOUET (philip.lallouet(AT)wanadoo.fr), Aug 29 2007
LINKS
EXAMPLE
a(4) = lcm(1, 2, 3, 4) - 1 = 12 - 1 = 11. a(5) = lcm(1, 2, 3, 4, 5) - 1 = 60 - 1 = 59. - Michael Somos, Feb 28 2014
MAPLE
A079782 := proc(n) local a, found, r ; a := n+1 ; while true do found := true ; for r from 1 to n do if (a+r-1) mod (n-r+1) <> 0 then found := false ; break ; fi ; od ; if found then RETURN(a+n-1) ; fi ; a :=a+1 ; od ; end: for n from 1 to 20 do print(A079782(n)) ; od ; # R. J. Mathar, Nov 12 2006
PROG
(PARI) okrow(m, n) = {v = vector(n, i, i+m-1); for (i=1, n, if (v[i] % (n-i+1), return (0)); ); return (1); }
a(n) = {m = n+1; while (! okrow(m, n), m++); m+n-1; } \\ Michel Marcus, Feb 28 2014
CROSSREFS
Sequence in context: A062251 A091114 A155767 * A371433 A093554 A168453
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Feb 03 2003
EXTENSIONS
More terms from R. J. Mathar, Nov 12 2006
More terms from Michel Marcus, Feb 28 2014
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 April 23 11:35 EDT 2024. Contains 371912 sequences. (Running on oeis4.)