Number of solutions to Nickerson variant of Langford (or Langford-Skolem) problem, as n runs through the positive numbers congruent to 0 or 1 mod 4.
A268535
Number of solutions to Nickerson variant of Langford (or Langford-Skolem) problem, as n runs through the positive numbers congruent to 0 or 1 mod 4.
Terms
- a(0) =1a(1) =3a(2) =5a(3) =252a(4) =1328a(5) =227968a(6) =1520280a(7) =700078384a(8) =6124491248
External references
- oeis: A268535