Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
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!)
A009692 Number of partitions of {1, 2, ..., 2n} into pairs whose differences are primes. 4

%I #23 Mar 01 2021 10:15:59

%S 1,0,1,3,10,40,153,921,5144,30717,230748,1766056,14052445,116580521,

%T 897876519,7657321097,75743979608,788733735080,7569825650083,

%U 75242386295617,831978453306391,9444103049405370,120064355466770831,1579842230380587833

%N Number of partitions of {1, 2, ..., 2n} into pairs whose differences are primes.

%e a(3) = 3: {{1,6}, {2,4}, {3,5}}, {{1,4}, {2,5}, {3,6}}, {{1,3}, {2,5}, {4,6}}. - _Alois P. Heinz_, Nov 15 2016

%p b:= proc(s) option remember; `if`(s={}, 1, (j-> add(`if`(i<j

%p and isprime(j-i), b(s minus {i, j}), 0), i=s))(max(s)))

%p end:

%p a:= n-> b({$1..2*n}):

%p seq(a(n), n=0..12); # _Alois P. Heinz_, Nov 15 2016

%t b[s_] := b[s] = If[s == {}, 1, Function[j, Sum[If[i < j && PrimeQ[j - i], b[s ~Complement~ {i, j}], 0], {i, s}]][Max[s]]];

%t a[n_] := b[Range[2n]];

%t Table[Print[n, " ", a[n]]; a[n], {n, 0, 18}] (* _Jean-François Alcover_, Mar 01 2021, after _Alois P. Heinz_ *)

%Y Cf. A000341.

%K nonn,hard

%O 0,4

%A _David W. Wilson_

%E a(0), a(14)-a(18) from _Alois P. Heinz_, Nov 15 2016

%E a(19)-a(23) from _Bert Dobbelaere_, Feb 20 2020

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 August 18 23:05 EDT 2024. Contains 375284 sequences. (Running on oeis4.)