The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A205013 The number s(j)=C(2j-2,j-1) such that n divides s(k)-s(j)>0, where k is the least positive integer for which such a j exists. 2
1, 2, 2, 2, 1, 2, 6, 6, 2, 20, 924, 252, 70, 6, 252, 6, 2, 2, 1, 252, 252, 924, 1, 252, 20, 70, 6, 252, 20, 252, 184756, 6, 924, 2, 2, 20, 2, 924, 3432, 70, 6, 252, 40116600, 924, 20, 20, 1, 252, 2, 20, 6, 3432, 252, 6, 12870, 252, 924, 20, 2333606220, 252 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
For a guide to related sequences, see A204892.
LINKS
MATHEMATICA
(See the program at A205010.)
CROSSREFS
Sequence in context: A198199 A366039 A124369 * A138258 A359812 A308367
KEYWORD
nonn
AUTHOR
Clark Kimberling, Jan 22 2012
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 June 14 23:20 EDT 2024. Contains 373401 sequences. (Running on oeis4.)