|
Search: id:A079782
|
|
| |
|
| 2, 5, 11, 11, 59, 59, 419, 839, 2519, 2519, 27719, 27719, 360359, 360359, 360359, 720719, 12252239, 12252239
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
For n>=4, a(n)=A003418(n+1)-1. Also for n<4 a(n) = smallest number equal to (i-1) mod i for any i in {1..n}. That results directy 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
|
|
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 (mathar(AT)strw.leidenuniv.nl), Nov 12 2006
|
|
CROSSREFS
|
Cf. A079781, A079783, A079784.
Adjacent sequences: A079779 A079780 A079781 this_sequence A079783 A079784 A079785
Sequence in context: A079008 A062251 A091114 this_sequence A093554 A136990 A136968
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 03 2003
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 12 2006
|
|
|
Search completed in 0.002 seconds
|
