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!)
A121934 Smallest positive number m such that m == i (mod i+1) for all 1<=i<=n. 1
1, 1, 5, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
For n>=2, a(n) = A003418(n+1)-1.
CROSSREFS
Except for the first term, a duplicate of A070198.
Sequence in context: A060358 A091798 A070198 * A153812 A269454 A153209
KEYWORD
nonn
AUTHOR
Zak Seidov, Sep 03 2006
EXTENSIONS
Edited by N. J. A. Sloane, Nov 18 2007, at the suggestion of Max Alekseyev.
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 25 07:07 EDT 2024. Contains 371964 sequences. (Running on oeis4.)