login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


k!!-j!!, where (k!!,j!!) is the least pair of double factorials for which n divides their difference.
3

%I #5 Mar 30 2012 18:58:10

%S 1,2,6,12,5,6,7,40,45,40,33,12,13,14,45,336,102,90,57,40,336,42240,46,

%T 336,3825,104,3456,336,645105,90,279,3456,33,102,840,3456,46065,3838,

%U 897,40,369,336,2026977,42240,45,46,47,336,10290,9450,102,104

%N k!!-j!!, where (k!!,j!!) is the least pair of double factorials for which n divides their difference.

%C For a guide to related sequences, see A204892.

%t (See the program at A204982.)

%Y Cf. A204982, A204892.

%K nonn

%O 1,2

%A _Clark Kimberling_, Jan 22 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 19 20:04 EDT 2024. Contains 376014 sequences. (Running on oeis4.)