Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121934
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A121934 Smallest positive number m such that m == i mod i+1 for all 1<=i<=n. +0
2
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; listen)
OFFSET

1,3

COMMENT

Except for the first term, a duplicate of A070198.

Starting with n=2, a(n)=A003418(n+1)-1. Cf. A003418 = least common multiple of {1..n}.

CROSSREFS

Cf. A070198, A003418.

Sequence in context: A060358 A091798 A070198 this_sequence A153812 A153209 A106257

Adjacent sequences: A121931 A121932 A121933 this_sequence A121935 A121936 A121937

KEYWORD

nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), Sep 03 2006

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Nov 18 2007, at the suggestion of Max Alekseyev.

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 24 19:42 EST 2009. Contains 167435 sequences.


AT&T Labs Research