login
This site is supported by donations 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

Table of n, a(n) for n=1..60.

MATHEMATICA

(See the program at A205010.)

CROSSREFS

Cf. A205010, A204892.

Sequence in context: A093116 A198199 A124369 * A138258 A205599 A265671

Adjacent sequences:  A205010 A205011 A205012 * A205014 A205015 A205016

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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 18 20:32 EST 2018. Contains 299330 sequences. (Running on oeis4.)